Space-efficient indexing of endgame tables for chess

Chess endgame tables should provide efficiently the value and depth of any required position during play. The indexing of an endgame’s positions is crucial to meeting this objective. This paper updates Heinz’ previous review of approaches to indexing and describes the latest approach by the first and third authors. Heinz’ and Nalimov’s endgame tables (EGTs) encompass the en passant rule and have the most compact index schemes to date. Nalimov’s EGTs, to the Distance-to-Mate (DTM) metric, require only 30.6 × 109 elements in total for all the 3-to-5-man endgames and are individually more compact than previous tables. His new index scheme has proved itself while generating the tables and in the 1999 World Computer Chess Championship where many of the top programs used the new suite of EGTs

Space-efficient Indexing of Chess Endgame Tables

Chess endgame tables should provide efficiently the value and depth of any required position during play. The indexing of an endgame’s positions is crucial to meeting this objective. This paper updates Heinz’ previous review of approaches to indexing and describes the latest approach by the first and third authors. Heinz’ and Nalimov’s endgame tables (EGTs) encompass the en passant rule and have the most compact index schemes to date. Nalimov’s EGTs, to the Distance-to-Mate (DTM) metric, require only 30.6 × 10^9 elements in total for all the 3-to-5-man endgames and are individually more compact than previous tables. His new index scheme has proved itself while generating the tables and in the 1999 World Computer Chess Championship where many of the top programs used the new suite of EGTs

Computer Chess: From Idea to DeepMind

Computer chess has stimulated human imagination over some two hundred and fifty years. In 1769 Baron Wolfgang von Kempelen promised Empress Maria Theresia in public: “I will invent a machine for a more compelling spectacle [than the magnetism tricks by Pelletier] within half a year.” The idea of an intelligent chess machine was born. In 1770 the first demonstration was given.The real development of artificial intelligence (AI) began in 1950 and contains many well-known names, such as Turing and Shannon. One of the first AI research areas was chess. In 1997, a high point was to be reported: world champion Gary Kasparov had been defeated by Deep Blue. The techniques used included searching, knowledge representation, parallelism, and distributed systems. Adaptivity, machine learning and the recently developed deep learning mechanism were only later on added to the computer chess research techniques.The major breakthrough for games in general (including chess) took place in 2017 when (1) the AlphaGo Zero program defeated the world championship program AlphaGo by 100-0 and (2) the technique of deep learning also proved applicable to chess. In the autumn of 2017, the Stockfish program was beaten by AlphaZero by 28-0 (with 72 draws, resulting in a 64-36 victory). However, the end of the disruptive advance is not yet in reach. In fact, we have just started. The next milestone will be to determine the theoretical game value of chess (won, draw, or lost). This achievement will certainly be followed by other surprising developments.Algorithms and the Foundations of Software technolog

Expertise in chess

This chapter provides an overview of research into chess expertise. After an historical background and a brief description of the game and the rating system, it discusses the information processes enabling players to choose good moves, and in particular the trade-offs between knowledge and search. Other topics include blindfold chess, talent, and the role of deliberate practice and tournament experience

The History of Computer Games

This handout presents milestones in the history of computer backgammon, computer bridge, computer checkers, computer chess, computer Go, computer Othello, and computer poker

The Collegian (2005-03-07)

https://scholarworks.utrgv.edu/collegian/1461/thumbnail.jp

Current, January 24, 1985

https://irl.umsl.edu/current1980s/1145/thumbnail.jp

Growing South Dakota (Fall 2023)

[Page] 3 Back-to-Back Champions: SDSU Quarter Scale Tractor Team Repeats International Win[Page] 6 CAFES Welcomes New Members to College Leadership Team[Page] 9 Vikram Mistry Retires After Nearly 40-Year Career at SDSU[Page] 12 Bill Gibbons Retires After 36 Years at SDSU[Page] 13 Nic Uilk: Klingbeil Endowed Educator in Precision Agriculture[Page] 15 SDSU Students Study Abroad[Page] 19 CAFES Faculty Claim National Awards[Page] 21 Dairy Alum Sanne de Bruijn Grabs Global Opportunities[Page] 23 SDSU Extension Cohort Programs[Page] 25 Summer Field Day Highlights[Page] 29 Jackrabbits Now and Thenhttps://openprairie.sdstate.edu/growingsd/1035/thumbnail.jp