Abstract
While Nalimov’s endgame tables for Western Chess are the most used today, their Depth-to-Mate metric is not the only one and not the most effective in use. The authors have developed and used new programs to create tables to alternative metrics and recommend better strategies for endgame play.
Chapter PDF
Similar content being viewed by others
References
Andrist, R. (2003). http://www.geocities.com/rba_schach2000/. WILHELM download. Bourzutschky, M. (2003). Private Communications to the authors.
Haworth, G.M`C. (2000). Strategies for Constrained Optimisation. ICGA Journal, Vol. 23, No. 1, pp. 9–20.
Haworth, G.M°C. (2001). Depth by The Rule. ICGA Journal, Vol. 24, No. 3, p. 160.
Haworth, G. MCC. (2003). Reference Fallible Endgame Play. ICGA Journal, Vol. 26, No. 2, pp. 81–91.
Haworth, G.M°C. and Andrist, R.B. (2003). Model Endgàme Analysis, Advances in Computer Games 10,Graz, Austria (eds. H.J. van den Herik, H. Iida, and E.A. Heinz). Kluwer Academic Publishers, Norwell, MA.
Hyatt, R. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing CRAFTY and Nalimov’s EGTs and statistics.
ICGA (2003). www.icga.org. Game-specific Information: Western Chess — Reference Data. Nalimov, E.V., Haworth, G.M`C., and Heinz, E.A. (2000a). Space-Efficient Indexing of Endgame Databases for Chess. ICGA Journal,Vol. 23, No. 3, pp. 148–162.
Nalimov, E.V., Haworth, G.M°C., and Heinz, E.A. (2000b). Space-Efficient Indexing of Endgame Databases for Chess. Advances in Computer Games 9,(eds. H. J. van den Herik and B. Monien). Institute for Knowledge and Agent Technology (IKAT), Maastricht, The Netherlands.
Tamplin, J. (2001). Private communication of pawnless Nalimov-compatible DTC EGTs.
Tamplin, J. (2003). http://chess.jaet.org/endings/ Multi-metric EGT site with services and downloads.
Tamplin, J. and Haworth, G.M`C. (2001). Ken Thompson’s 6-man Tables. ICGA Journal, Vol. 24, No. 2, pp. 83–85.
Thompson, K. (1986). Retrograde Analysis of Certain Endgames. ICCA Journal, Vol. 9, No. 3, pp. 131–139.
Thompson, K. (2000). 6-man EGT maximal positions and mutual zugzwangs. http://cm.belllabs.com/cm/cs/who/ken/chesseg.html.
Wirth, C. and Nievergelt, J. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA Journal, Vol. 22, No. 2, pp. 67–80.
Wu, R. and Beal, D.F. (2001a). Computer Analysis of some Chinese Chess Endgames Advances in Computer Games 9, (eds. H. J. van den Herik and B. Monien), pp. 261–273. Institute for Knowledge and Agent Technology (IKAT), Maastricht, The Netherlands.
Wu, R. and Beal, D.F. (2001b). Fast, Memory-Efficient Retrograde Algorithms. ICGA Journal Vol. 24, No. 3, pp. 147–159.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Tamplin, J.A., Haworth, G.M. (2004). Chess Endgames: Data and Strategy. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds) Advances in Computer Games. IFIP — The International Federation for Information Processing, vol 135. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35706-5_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive