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.
c tree algorithm backtracking queens-puzzle queens-problem backtracking-search n-queens backtracking-algorithm nqueens algorithm-c backtracking-questions backtracking-tech-interview backtracking-methods c-algorithm backtracking-tree
- Updated
Dec 10, 2022 - C