An upper bound for the number of chess diagrams without promotion - Avignon Université Accéder directement au contenu
Article Dans Une Revue International Computer Games Association Journal Année : 2022

An upper bound for the number of chess diagrams without promotion

Daniel Gourion

Résumé

In 2015, Steinerberger showed that the number of legal chess diagrams without promotion is bounded from above by $2\times 10^{40}$. This number was 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 legal 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 arrangements, leading to a method for bounding pawn positions with any number of men on the board.
Fichier principal
Vignette du fichier
postprint.pdf (239.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03483904 , version 1 (16-12-2021)
hal-03483904 , version 2 (17-11-2022)

Identifiants

Citer

Daniel Gourion. An upper bound for the number of chess diagrams without promotion. International Computer Games Association Journal, 2022, 44 (2), pp.44-55. ⟨10.3233/ICG-220210⟩. ⟨hal-03483904v2⟩
409 Consultations
839 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More