An algorithm to find all unique configurations of a set of normal chess pieces on a chess board with dimensions MxN where none of the pieces is in a position to take any of the others. The colour of the piece does not matter, and there are no pawns among the pieces.
forked from nencho83/ChessPieces
-
Notifications
You must be signed in to change notification settings - Fork 0
An algorithm to find all unique configurations of a set of normal chess pieces on a chess board with dimensions MxN where none of the pieces is in a position to take any of the others. The colour of the piece does not matter, and there are no pawns among the pieces.
narayana-glassbeam/ChessPieces
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An algorithm to find all unique configurations of a set of normal chess pieces on a chess board with dimensions MxN where none of the pieces is in a position to take any of the others. The colour of the piece does not matter, and there are no pawns among the pieces.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Java 100.0%