Category:Chess mathematical problems
Jump to navigation
Jump to search
mathematical problem based on the board game chess  number of ways a king on a chessboard can reach other positions using the minimal number of moves | |||||
| Upload media | |||||
| Subclass of |
| ||||
|---|---|---|---|---|---|
| Facet of | |||||
| Different from | |||||
| |||||
 | |||||
Subcategories
This category has the following 3 subcategories, out of 3 total.
Media in category "Chess mathematical problems"
The following 12 files are in this category, out of 12 total.
-
Dudeney no 3 pawns in line.svg 512 × 512; 398 bytes
-
Eight Queens12 positions.gif 257 × 257; 98 KB
-
Gomory.png 204 × 204; 5 KB
-
HuitRois.png 163 × 169; 3 KB
-
King walks.svg 230 × 230; 44 KB
-
N hasta 10 AAS.png 60 × 210; 2 KB
-
Queens time log.png 655 × 461; 7 KB
-
Schachmathematik Keym.jpg 244 × 248; 23 KB
-
Sister Pascal Triangle Pathways.png 635 × 743; 29 KB
-
Skaken- it tal mooglike hynstesprongen.jpg 739 × 739; 109 KB
-
Tablero 4x4 AAS.png 408 × 132; 7 KB
-
Tablero 5x5 AAS.png 669 × 522; 28 KB
