pith. sign in

arxiv: math/9905198 · v1 · submitted 1999-05-31 · 🧮 math.CO

On numbers and endgames: Combinatorial game theory in chess endgames

classification 🧮 math.CO
keywords chesspositionscombinatorialendgamesgametheoryvaluesapplications
0
0 comments X
read the original abstract

In an investigation of the applications of Combinatorial Game Theory to chess, we construct novel mutual Zugzwang positions, explain an otherwise mysterious pawn endgame from "A Guide to Chess Endings" (Euwe and Hooper), show positions containing non-integer values (fractions, switches, tinies, and loopy games), and pose open problems concerning the values that may be realized by positions on either standard or nonstandard chessboards.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.