Backtracking
A simple kakuro CSP problem solver from AIMA python https://github.com/aimacode/aima-python
A gui program, which takes an .png image of a sudoku and solves the maze.
The shortest way solution to the n-queens question | 8x8 board
Dealing with problem related to astrophysical data like identifying the constellations present in night sky image, indexing the observed objects in space to the catalogue objects present, identifying the clusters of celestial objects based on the linking length and finding the correlated distance based on given data and finding shortest path/route.
This is a promising implementation of the n-Queens problem in C. It uses a recursive backtracking algorithm to find all solutions to the n-Queens problem. It is a promising implementation because it uses a heuristic to prune the search tree. The heuristic is to only place a queen in a column if it is not in check with any other queens.
Add a description, image, and links to the backtracking-methods topic page so that developers can more easily learn about it.
To associate your repository with the backtracking-methods topic, visit your repo's landing page and select "manage topics."