422
edits
Changes
→Chess Maxima: added the Shannon number from 1950
<span id="Maxima"></span>
=Chess Maxima=
* In 1950 [[Claude Shannon]] gave a conservative lower bound ([https://en.wikipedia.org/wiki/Shannon_number the Shannon number]) of the game-tree complexity of chess of 10^120 (possible games), and 10^43 for the amount of possible positions.<ref>[https://www.computerhistory.org/chess/doc-431614f453dde/ Programming a Computer for Playing Chess. download pdf from The Computer History Museum]</ref>
* In 1966, Eero Bonsdorff, [https://en.wikipedia.org/wiki/Karl_Fabel Karl Fabel], and Olvai Riihimaa gave 5899 as the maximum number of [[Moves|moves]] in a chess game <ref>Eero Bonsdorff, [https://en.wikipedia.org/wiki/Karl_Fabel Karl Fabel], Olvai Riihimaa ('''1966''') ''Schach und Zahl - Unterhaltsame Schachmathematik''. Seite 11-13, Walter Rau Verlag, Düsseldorf (German)</ref> <ref>[http://de.wikipedia.org/wiki/50-Z%C3%BCge-Regel#Schachmathematik 50-Züge-Regel - Schachmathematik from Wikipedia.de] (German)</ref> <ref>[http://www.xs4all.nl/~timkr/chess2/honor.htm Defending Humanity's Honor] by [https://en.wikipedia.org/wiki/Tim_Krabb%C3%A9 Tim Krabbé], see game [[Rival|NewRival]] - [[Faile]] with 493 moves, and playing 402 moves with bare kings!</ref>
* [[Shirish Chinchalkar]] has determined a [https://en.wikipedia.org/wiki/Game_complexity#State-space_complexity state-space complexity] of 10<span style="font-size: 80%; vertical-align: super;">46.25</span> as upper bound for the number of reachable [[Chess Position|chess positions]] <ref>[[Shirish Chinchalkar]] ('''1996'''). ''An Upper Bound for the Number of Reachable Positions''. [[ICGA Journal#19_3|ICCA Journal, Vol. 19, No. 3]]</ref>, [[John Tromp]] gives about 10^45.888 <ref>[http://tromp.github.io/chess/chess.html John's Chess Playground - Number of chess diagrams and positions]</ref> <ref>[http://www.talkchess.com/forum/viewtopic.php?t=51744&start=3 Re: Total possible chess positions?] by [[Álvaro Begué]], [[CCC]], March 26, 2014</ref>
