A solution to N Queens problem using backtracking
-
Updated
Nov 19, 2016 - C
A solution to N Queens problem using backtracking
A sudoku solver to solve any n*n puzzle.
A recursive implementation of 9x9 sudoku solver in C. Uses simple backtracking.
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.
This is an implementation of the Sub Set Sum Backtracking algorithm in C. The algorithm is used to find a subset of a given set of numbers that adds up to a given sum. The algorithm is implemented using backtracking.
Yet Another Sat solvER
Add a description, image, and links to the backtracking-search topic page so that developers can more easily learn about it.
To associate your repository with the backtracking-search topic, visit your repo's landing page and select "manage topics."