Solving chess
If both sides played perfectly from the ordinary starting position, would chess end in a draw or a forced win? An unbeatable-looking engine does not yet supply that proof.
Games and strategies
Perfect play in chess, winners in graph games, and pursuit strategies.
Subjects: Algorithms and data structures · Graph theory
Problems in this collection
3 problemsPolynomial-time parity-game solving
Can the winner of every finite parity game be determined in polynomial time?
Meyniel’s conjecture
Can O(√n) pursuers catch a visible evader on every connected n-vertex graph?