
(This work was in fact first done and published by Thomas Strohlein, Munich, in 1970, but only a single analytical line is contained in his doctoral thesis.)' 'Niblett and Kopec described, and later demonstrated, the optimal 0103 data base. Untersuchungen über kombinatorische Spiele Ph.D. Proceedings of the National Academy of Sciences of the United States of America 53 (2): 244–246. 'On the application of dynamic programming to the determination of optimal play in chess and checkers'. Department of Computer Science, University of Limburg. Searching for Solutions in Games and Artificial Intelligence. ^ examples of long endings for Gothic chess.


Ke6! Stiller reported the DTC as 243 moves, and the DTM was later found to be 262 moves. Even more amazing is the position at right, where White wins starting with 1. The longest win in KRBKNN has a DTC of 223 and a DTM of 238 moves (not shown). Stiller's DTC tablebase revealed several lengthy wins in these endgames. KRNKNN and KRBKNN are won for the strongest side in 78% and 95% of the cases, respectively.

Analysis of the tablebases has clarified that even if the pawn has crossed the Troitzky line, White can sometimes win by forcing zugzwang.
