422
edits
Changes
m
→2020 ...: typo fix
* [[Match Statistics]]
* [[Playing Strength]]
* [[Rules of Chess]] (Computer Chess related)
* [[Time Management]]
<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>
* [[Julian Schrittwieser]], [[Ioannis Antonoglou]], [[Thomas Hubert]], [[Karen Simonyan]], [[Laurent Sifre]], [[Simon Schmitt]], [[Arthur Guez]], [[Edward Lockhart]], [[Demis Hassabis]], [[Thore Graepel]], [[Timothy Lillicrap]], [[David Silver]] ('''2020'''). ''[https://www.nature.com/articles/s41586-020-03051-4 Mastering Atari, Go, chess and shogi by planning with a learned model]''. [https://en.wikipedia.org/wiki/Nature_%28journal%29 Nature], Vol. 588 <ref>[https://deepmind.com/blog/article/muzero-mastering-go-chess-shogi-and-atari-without-rules?fbclid=IwAR3mSwrn1YXDKr9uuGm2GlFKh76wBilex7f8QvBiQecwiVmAvD6Bkyjx-rE MuZero: Mastering Go, chess, shogi and Atari without rules]</ref>
* [[Monroe Newborn|Monty Newborn]] ('''2021'''). ''Mad Monty Chess''. [[ICGA Journal#43_1|ICGA Journal, Vol. 43, No. 1]]
* [[Maximilian Alexander Gehrke]] ('''2021'''). ''Assessing Popular Chess Variants Using Deep Reinforcement Learning''. Master thesis, [[Darmstadt University of Technology|TU Darmstadt]], [https://ml-research.github.io/papers/gehrke2021assessing.pdf pdf] » [[CrazyAra]]
* [[Dominik Klein]] ('''2021'''). ''[https://github.com/asdfjkl/neural_network_chess Neural Networks For Chess]''. [https://github.com/asdfjkl/neural_network_chess/releases/tag/v1.1 Release Version 1.1 · GitHub] <ref>[https://www.talkchess.com/forum3/viewtopic.php?f=2&t=78283 Book about Neural Networks for Chess] by dkl, [[CCC]], September 29, 2021</ref>
* [[Guy Haworth]] ('''2021'''). ''Chess without draws''. [[ICGA Journal#43_2|ICGA Journal, Vol. 43, No. 2]]
* [[Thomas McGrath]], [[Andrei Kapishnikov]], [[Nenad Tomašev]], [[Adam Pearce]], [[Demis Hassabis]], [[Been Kim]], [[Ulrich Paquet]], [[Vladimir Kramnik]] ('''2021'''). ''Acquisition of Chess Knowledge in AlphaZero''. [https://arxiv.org/abs/2111.09259 arXiv:2111.09259] » [[AlphaZero]] <ref>[https://en.chessbase.com/post/acquisition-of-chess-knowledge-in-alphazero Acquisition of Chess Knowledge in AlphaZero], [[ChessBase|ChessBase News]], November 18, 2021</ref>
* [[Miha Bizjak]], [[Matej Guid]] ('''2021'''). ''Automatic Recognition of Similar Chess Motifs''. [[Advances in Computer Games 17]]
* [[Nenad Tomašev]], [[Ulrich Paquet]], [[Demis Hassabis]], [[Vladimir Kramnik]] ('''2022'''). ''[https://cacm.acm.org/magazines/2022/2/258230-reimagining-chess-with-alphazero/fulltext Reimagining Chess with AlphaZero]''. [[ACM#Communications|Communications of the ACM]], Vol. 65, No. 2 » [[AlphaZero]]
=Forum Posts=
'''2021'''
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=76382 correspondence chess in the age of NNUE] by [[Larry Kaufman]], [[CCC]], January 21, 2021 » [[NNUE]]
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=77685 On the number of chess positions] by [[John Tromp]], [[CCC]], July 09, 2021 » [[Chess Position]]
* [https://www.talkchess.com/forum3/viewtopic.php?f=7&t=78464 Open Chess Game Database Standard (OCGDB)] by [[Pham Hong Nguyen|Nguyen Pham]], [[CCC]], October 20, 2021 » [[Databases|Chess Databases]]
'''2022'''
* [https://www.talkchess.com/forum3/viewtopic.php?f=7&t=77685&start=34 Re: On the number of chess positions] by [[John Tromp]], [[CCC]], April 02, 2022 » [[Chess Position]]
'''2023'''
* [https://talkchess.com/forum3/viewtopic.php?f=2&t=81858 The Next Big Thing in Computer Chess?] by [[Srdja Matovic]], [[CCC]], April 12, 2023 » [[Artificial Intelligence]], [[Programming]], [[Hardware]]
:[https://talkchess.com/forum3/viewtopic.php?f=2&t=81858&start=100#p951488 Re: The Next Big Thing in Computer Chess?] by [[Srdja Matovic]], [[CCC]], August 20, 2023
* [https://talkchess.com/forum3/viewtopic.php?f=2&t=82826 Is there any project coming to solve chess?] by Jouni, [[CCC]], November 06, 2023
=External Links=
