Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

An upper bound for the number of chess diagrams without promotion

Abstract : The number of legal chess diagrams without promotion is bounded from above by $2 \times 10^{40}$. This number is obtained by restricting both bishops and pawns position and by a precise bound when no chessman has been captured. We improve this estimate and show that the number of diagrams is less than $4 \times 10^{37}$. To achieve this, we define a graph on the set of diagrams and a notion of class of pawn structure, leading to a method for bounding pawn positions with any number of men on the board.
Complete list of metadata
Contributor : Daniel Gourion Connect in order to contact the contributor
Submitted on : Thursday, December 16, 2021 - 4:49:07 PM
Last modification on : Saturday, December 18, 2021 - 3:26:36 AM


Files produced by the author(s)


  • HAL Id : hal-03483904, version 1



Daniel Gourion. An upper bound for the number of chess diagrams without promotion. 2021. ⟨hal-03483904⟩



Les métriques sont temporairement indisponibles