https://github.com/danielbrodi/knights-tour
The Knight’s tour problem solved in C with both the naive and the heuristic solutions, using a backtracking algorithm, recursion and a bit array. Includes GUI,
https://github.com/danielbrodi/knights-tour
backtracking backtracking-algorithm c chess chess-ai chess-board chess-game chessboard heuristic-algorithm heuristic-search heuristic-search-algorithms heuristics knight-problem knight-tour knights-tour knightstour memory-management options-strategies recursion recursive-algorithm
Last synced: about 1 month ago
JSON representation
The Knight’s tour problem solved in C with both the naive and the heuristic solutions, using a backtracking algorithm, recursion and a bit array. Includes GUI,
- Host: GitHub
- URL: https://github.com/danielbrodi/knights-tour
- Owner: danielbrodi
- License: mit
- Created: 2021-08-18T22:29:51.000Z (almost 4 years ago)
- Default Branch: master
- Last Pushed: 2021-09-15T22:58:21.000Z (almost 4 years ago)
- Last Synced: 2023-03-22T16:26:00.982Z (about 2 years ago)
- Topics: backtracking, backtracking-algorithm, c, chess, chess-ai, chess-board, chess-game, chessboard, heuristic-algorithm, heuristic-search, heuristic-search-algorithms, heuristics, knight-problem, knight-tour, knights-tour, knightstour, memory-management, options-strategies, recursion, recursive-algorithm
- Language: C
- Homepage:
- Size: 346 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0