https://github.com/tornao2/chessproblems
Knight's tour and N queen problem solving program using a backtracking algorithm allowing generating the next solution without resetting created in C++ with the "RayLib" graphical library
https://github.com/tornao2/chessproblems
algorithms cpp raylib
Last synced: over 1 year ago
JSON representation
Knight's tour and N queen problem solving program using a backtracking algorithm allowing generating the next solution without resetting created in C++ with the "RayLib" graphical library
- Host: GitHub
- URL: https://github.com/tornao2/chessproblems
- Owner: Tornao2
- Created: 2024-05-05T10:15:40.000Z (about 2 years ago)
- Default Branch: master
- Last Pushed: 2024-06-04T09:59:47.000Z (about 2 years ago)
- Last Synced: 2024-11-18T21:20:57.394Z (over 1 year ago)
- Topics: algorithms, cpp, raylib
- Language: C++
- Homepage:
- Size: 201 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Knight's tour and N queen problem solving program using a backtracking algorithm allowing generating the next solution without clean reset created in C++ with the "RayLib" graphical library.
Size of the chessboard and the starting position of the first piece can be chosen. When working with 8x8 chessboard algorithms can take quite a bit - especially the knights one depending on the starting position.
Demonstration at:
https://www.youtube.com/watch?v=_8Sd4qwD4CY



