-
Notifications
You must be signed in to change notification settings - Fork 0
The aim is to solve a variant of the chess queens problem, using knights instead, to find out how many knights can be present on a chessboard without threatening each other. Any configuration of knights on the board is valid as long as they do not threaten each other, but you want to find the maximum number of knights.
CarrotAsh/chess_knights_problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
About
The aim is to solve a variant of the chess queens problem, using knights instead, to find out how many knights can be present on a chessboard without threatening each other. Any configuration of knights on the board is valid as long as they do not threaten each other, but you want to find the maximum number of knights.
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published