Abstract
In 1970, Thomas Strohlein 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
