On the number of positions in chess without promotion

Stefan Steinerberger ()

International Journal of Game Theory, 2015, vol. 44, issue 3, 767 pages

Abstract: The number of different legal positions in chess is usually estimated to be between $$10^{40}$$ 10 40 and $$10^{50}$$ 10 50 . Within this range, the best upper bound $$10^{46}$$ 10 46 is some orders of magnitude bigger than the estimate $$5 \times 10^{42}$$ 5 × 10 42 made by Claude Shannon in his seminal 1950 paper, which is usually considered by computer scientists to be a better approximation. We improve Shannon’s estimate and show that the number of positions where any number of chessmen may have been captured but no promotion has occured is bounded from above by $$2 \times 10^{40}$$ 2 × 10 40 . The actual number should be quite a bit smaller than that and outline possible ways towards improving our result. Copyright Springer-Verlag Berlin Heidelberg 2015

Keywords: Shannon’s number; Chess; State space (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00182-014-0453-7 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:44:y:2015:i:3:p:761-767

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-014-0453-7

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().