Thomas Ströhlein's Endgame Tables: a 50th Anniversary

Haworth, G. ORCID: https://orcid.org/0000-0001-9896-1448 (2020) Thomas Ströhlein's Endgame Tables: a 50th Anniversary. ICGA Journal, 42 (2-3). pp. 165-170. ISSN 1389-6911 doi: 10.3233/ICG-200151

Abstract/Summary

In 1970, Thomas Ströhlein gained his doctorate with the thesis 'Research on Combinatorial Games'. This included a graph-theoretic definition of an algorithm for computing endgame tables for chess. The computation was carried out on the LRZ AEG TR4 computer in Munich. The results spanned KRk, KQk, KRkb, KRkn and the iconic 'hard endgame' KQkr, and included maximal depths (to conversion), lists of maximal-depth positions and optimal moves. Here, we celebrate the 50th anniversary of this achievement and put his results in a broader context.

Item Type	Article
URI	https://reading-clone.eprints-hosting.org/id/eprint/90000
Item Type	Article
Refereed	Yes
Divisions	Science > School of Mathematical, Physical and Computational Sciences > Department of Computer Science
Uncontrolled Keywords	50 move rule, Carlsen, LeelaChessZero, Ruy Lopez, Stockfish
Publisher	The International Computer Games Association
Download/View statistics	View download statistics for this item