Changes

* 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>

: <fentt border="double" style="font-size:24pt">R6R/3Q4/1Q4Q1/4Q3/2Q4Q/Q4Q2/pp1Q4/kBNN1KB1</fentt>

R6R/3Q4/1Q4Q1/4Q3/2Q4Q/Q4Q2/pp1Q4/kBNN1KB1 w - - 0 1

==2000 ...==

* [https://www.stmintz.com/ccc/index.php?id=272654 Does this position blow up your program?] by [[Michael Byrne|Mike Byrne]], [[CCC]], December 23, 2002

* [http://www.talkchess.com/forum/viewtopic.php?t=17338 Variants and Board Size] by [[Harm Geert Muller]], [[CCC]], October 25, 2007

==2010 ...==