CEN: Thomas Ströhlein’s Endgame Tables,a 50 th Anniversary

Althöfer, I. (2019). Althöfer, I. (2019) Private correspondence, 2019-12-09.

Bauer, F.L., ed. (2007). 40 Jahre Informatik in München: 1967-2007, Festschrift, esp. (pp. 101–102). Fakultät für Informatik (IN) der Technischen Universität München.

Bellman, R.E. (1965). On the application of dynamic programming to the determination of optimal play in chess and checkers. PNAS, 53(2), 244–247. doi:10.1073/pnas.53.2.244.

Bitsavers (2007) http://bitsavers.trailing-edge.com/pdf/aeg-telefunken/tr4/. A TR4 archive.

Bleicher, E. (2010). http://www.k4it.de/. Sub-7-man DTM EGT query service.

CPW (2020a). https://www.chessprogramming.org/TR-4 The Telefunken-Rechner 4.

CPW (2020b). https://www.chessprogramming.org/Thomas_Strohlein.

de Man, R., Guo, B. & Fiekas, N. (2018). F’s query interface to deM/G’s s8m DTZ 50 ″ EGTs.

Haworth, G.McC. (2020). centaur.reading.ac.uk/89998/. This note with supporting data, image, pgn and text files.

Jansen, P.J. (1992). KQKR: Awareness of a fallible opponent. ICCA Journal, 15(3), 111–131. See also ICCA Journal, 15(4), 179–191 and 16(1), 3–17.

Kopec, D. (1990). Advances in man-machine play, esp. §2.4. In T.A. Marsland and J. Schaeffer (Eds.), Computers, Chess and Cognition.

Lomonosov (2012). http://tb7.chessok.com/. Facility for querying sub-8-man DTM EGTs.

Nalimov, E.V., Haworth, G.M. & Heinz, E.A. (2000). Space-efficient indexing of chess endgame tables. ICGA Journal, 23(3), 148–162. doi:10.3233/ICG-2000-23304.

Sapper, G. (2020). http://www.qslnet.de/member1/dj4kw/tr4.htm. The Telefunken TR4 at the Leibniz Computing Centre, Bavarian Academy of Sciences, Munich.

Schmidt, G. & Ströhlein, T. (1985). On kernels of graphs and solutions of games: A synopsis based on relations and fixpoints. Dedicated to F.L. Bauer on the occasion of his 60^th birthday. SIAM J. on Algebraic and Discrete Methods, 6(1), 54–65. doi:10.1137/0606006.

Schmidt, G. & Ströhlein, T. (1989). Relationen und Graphen, Springer-Verlag, Berlin (Mathematik für Informatiker), esp. pp. 199–202.

Schmidt, G. & Ströhlein, T. (1993). Relations and Graphs, esp. pp. 194–196. In the Springer Discrete Mathematics for Computer Scientists series, as improved, extended and translated. doi:10.1007/978-3-642-77968-8.

Ströhlein, T. (1970). Untersuchungen über kombinatorische Spiele. Doctoral dissertation, Technische Hochschule, München.

Ströhlein, T. (1976). Iterative Berechnung der Kerne eines Graphen und der Lösung eines Spiels. In Graphen, Algorithmen, Datenstrukturen (ed. H. Noltemeier). Ergebnisse des Workshops WG76, 2. Fachtagung über graphentheoretische Konzepte der Informatik. 16^th–18^th June, 1976, Göttingen, München. Hanser.

Ströhlein, T. (2020). Private communication: Six bound volumes of original TR-4 lineprinter listings covering KRkn and KQkr wins and losses, a copy of ‘TUM-INFO’ and Relations and Graphs in German and in English.

Ströhlein, T. & Zagler, L. (1977). Analysing games by Boolean matrix iteration. Discrete Math., 19, 183–193. doi:10.1016/0012-365X(77)90033-4.

Ströhlein, T. & Zagler, L. (1978). Ergebnisse einer vollständigen Analyse von Schachendspielen König und Turm gegen König, König und Turm gegen König und Läufer. Institute für Mathematik und Informatik, Technische Universität München. TUM-INFO-09-78-00=0200/1-FBMA.

Tamplin, J.T. & Haworth, G.M. (2001). Ken Thompson’s 6-man tables. ICGA Journal, 24(2), 83–85. http://centaur.reading.ac.uk/4561/ . doi:10.3233/ICG-2001-24207.

Van den Herik, J. (2020). Private correspondence.