There are 2 repositories under backtracking-search topic.
Nonlinear optimization solving with multiple Python libraries
Library for back tracking with customizable search for moves
Artificial Intelligence Course 3rd Project: Implementing CSP Backtracking, Forward Checking and MAC Algorithms in order to solve a binary puzzle
Crosswords puzzle generator and publisher using Constraints Satisfaction Problem (CSP) technique. With minimal backtracks.
This repository contains generic platform for solving and benchmarking computational puzzles using different search strategies
Example lecture for Constraint Satisfaction Problems in an interactive jupyter notebook. With python code to solve CSPs, with visualization of Sudoku and NQueens problems.
Samurai Sudoku solver in Python
MIRROR of https://codeberg.org/catseye/Backtracking-Wang-Tiler : A backtracking algorithm for tiling the plane with Wang tiles
This is a UI Sudoku Game And Solver that makes use of recursion and backtracking
Algorithms to solve small mazes with prolog
Artificial Intelligence Course 3rd Project: Implementing CSP Backtracking, Forward Checking and MAC Algorithms in order to solve a binary puzzle
Sudoku CSP Solver using Backtracking Search and Arc-Consistency 3
⚔️ 🛡️ 🐲 A project based in Knowledge Base Representation and Logic Programming. This project was built using Prolog, with the support of SWISH and SWI-Prolog. The project it's a simple application to allow to make checks, verifications and queries, about some informations and data, of the TV Show Series of Game of Thrones, through a knowledge base representation, built with facts, predicates and rules, among many others!
Classic CSP Algorithms to solve RLFAP
Yet Another Sat solvER
A Java program that uses DFS to generate all the possible patterns on a traditional 3x3 Android lock screen
Backtracking
Numerical Optimization library implementing Gradient Descent and Newton's method using backtracking line search for finding the minimum.
This project is a sudoku-solver implement by Constraint satisfaction problem. We add the colour option to our sudoku problem as if the number of a place is bigger than other neighbours, the colour of that place must be higher in a given colour's priority. We use the Constraint satisfaction problem(CSP), as we said before, in additional apply degree and MRV heuristic for selecting a variable. After we assigned a value to the selected variable, apply forward-checking to update the domain of variables. If there is a solution for the sudoku problem, we report it; otherwise, the search is unsuccessful, and we have not a solution.
API to get maximum movies which an actor can sign without date conflicts using Flask and C++
AI that generates crosswords puzzles using Backtracking Search algorithm.
Implementation of Peter Norvig's sudoku solving and backtracking algorithms in java.
Simple maze solving program with recursive backtracking and exhaustive searching
A solution to a binary puzzle using CSP algorithms.
🎓 👨🎓 📚 A project based in Knowledge Base Representation and Logic Programming. This project was built using Prolog, with the support of SWISH and SWI-Prolog. The project it's a simple application to allow to make checks, verifications and queries, about some informations and data, of Faculty of Sciences and Technology of New University of Lisbon, through a knowledge base representation, built with facts, predicates and rules, among many others!
An agent that can solve Sudoku puzzles, following a backtracking search, using a combination of depth-first search and constraint propagation.
Web based visualisation of various search algorithms implemented in prolog for teaching
The shortest way solution to the n-queens question | 8x8 board
This project aims to show how to solve a given Sudoku in two different ways, through Backtracking (in a flavour of Forward Checking) and Relaxation Labeling.
Solve Sudoku as a Constraint Satisfaction Problem