https://github.com/basemax/nqueenspromisingc
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.
https://github.com/basemax/nqueenspromisingc
algorithm algorithm-c backtracking backtracking-algorithm backtracking-methods backtracking-questions backtracking-search backtracking-tech-interview backtracking-tree c c-algorithm n-queens nqueens queens-problem queens-puzzle tree
Last synced: 3 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/basemax/nqueenspromisingc
- Owner: BaseMax
- License: gpl-3.0
- Created: 2022-12-10T05:18:02.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2022-12-10T06:57:29.000Z (over 2 years ago)
- Last Synced: 2025-03-28T17:08:07.896Z (3 months ago)
- Topics: algorithm, algorithm-c, backtracking, backtracking-algorithm, backtracking-methods, backtracking-questions, backtracking-search, backtracking-tech-interview, backtracking-tree, c, c-algorithm, n-queens, nqueens, queens-problem, queens-puzzle, tree
- Language: C
- Homepage:
- Size: 29.3 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0