Mathematics in Chess
Chessboard problems about movement graphs, parity, and non-attacking placements, with interactive visual validators.
IntermediateMathematics
Combinatorics · Graph TheoryMathematics in Chess · Mathematics in Chess: Visual ProblemsAlgebra · Mathematics in Chess
Guide
Mathematics in Chess: Visual Problems
Mathematical chess problems model constraints on a board and ask for structure, not gameplay skill.
This collection focuses on:
- exact-move return questions for knights,
- constructive placement constraints,
- Hamiltonian-cycle style movement tasks,
- maximum non-attacking placements,
- degree-constrained knight graphs.
Each problem includes a visual interactive so learners can test constructions and receive immediate validation.
Topics
Practice problems
Knight Return in 4 MovesCMC-001
Knight Return in 5 MovesCMC-002
Knight Return in 2025 MovesCMC-003
Knight Return in 2026 MovesCMC-004
Equal Files, Distinct RanksCMC-005
Flying Rook Cycle on 4x4CMC-006
Maximum Non-Attacking KingsCMC-007
Maximum Non-Attacking RooksCMC-008
Maximum Non-Attacking BishopsCMC-009
Maximum Non-Attacking KnightsCMC-010
Maximum Non-Attacking QueensCMC-011
4 Knights, Degree 2CMC-012
8 Knights, Degree 2CMC-013
16 Knights, Degree 2CMC-014
32 Knights, Degree 2CMC-015