Space-efficient indexing of endgame tables for chess

Downloads

Beal, D.F. (1999). The 9th World Computer-Chess Championship: the Search-Engine Features of the Programs. ICCA Journal, Vol. 22, No. 3, pp. 160-163. ISSN 0920-234X. Edwards, S.J. (1995). Comments on Barth’s Article “Combining Knowledge and Search to Yield Infallible Endgame Programs.” ICCA Journal, Vol. 18, No. 4, p. 219-225. ISSN 0920-234X. Forthoffer, D., Rasmussen, L. and Dekker, S.T. (1989). A Correction to Some KRKB-Database Results. ICCA Journal, Vol. 12, No. 1, pp. 25-27. ISSN 0920-234X. Hamlen, J. and Feist, M. (1997). Report on the 15th World Microcomputer Chess Championship. ICCA Journal, Vol. 20. No. 4, pp. 254-255. ISSN 0920-234X. Haworth, G.McC. (2000). Private communication to Karrer, Nalimov, Rasmussen and Wirth. Heinz, E.A. (1997). How DARKTHOUGHT plays Chess. ICCA Journal, Vol. 20, No. 3, pp. 166-176. ISSN 0920-234X. Heinz, E.A. (1999). Endgame Databases and Efficient Index Schemes for Chess. ICCA Journal, Vol. 22, No. 1, pp. 22-32. ISSN 0920-234X. Heinz, E.A. (2000). Scalable Search in Computer Chess. Vieweg Verlag (Mor-gan Kaufmann), Braunschweig/Wiesbaden. ISBN 3-5280-5732-7. Herik, H.J. van den and Herschberg, I.S. (1985). The Construction of an Omniscient Endgame Database. ICCA Journal, Vol. 8, No. 2, pp. 66-87. ISSN 0920-234X. Herik, H.J. van den and Herschberg, I.S. (1986). A Data Base on Data Bases. ICCA Journal, Vol. 9, No. 1, pp. 29-34. ISSN 0920-234X. Hyatt, R. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing CRAFTY and Nalimov’s EGTs and statistics. Space-Efficient Indexing of Endgame Tables for Chess 105 ICCA J. Editors (1992). Thompson: All About Five Men. ICCA Journal, Vol. 15, No. 3, pp. 140-143. ISSN 0920-234X. ICCA J. Editors (1993). Thompson: Quintets with Variations. ICCA Journal, Vol. 16, No. 2, pp. 86-90. ISSN 0920-234X. Karrer, P. (2000). KQQKQP and KQPKQP≈. ICGA Journal, Vol. 23, No. 2, pp. 75-84. ISSN 1389-6911. Nalimov, E.V., Wirth, C., and Haworth, G.McC. (1999). KQQKQQ and the Kasparov-World Game. ICCA Journal, Vol. 22, No. 4, pp. 195-212. ISSN 0920-234X. Stiller, L.B. (1989). Parallel Analysis of Certain Endgames. ICCA Journal, Vol. 12, No. 2, pp. 55-64. ISSN 0920-234X. Stiller, L.B. (1991). Group Graphs and Computational Symmetry on Massively Parallel Architecture. The Journal of Supercomputing, Vol. 5, No. 2, pp. 99-117. Stiller, L.B. (1994). Multilinear Algebra and Chess Endgames. Games of No Chance (ed. R.J. Nowakowski), pp. 151-192. MSRI Publications, v29, CUP, Cambridge, England. ISBN 0-5215-7411-0. Reprinted in paperback (1996). ISBN 0-5216-4652-9. Stiller, L.B. (1995). Exploiting Symmetry of Parallel Architectures. Ph.D. Thesis, Department of Computer Sciences, The John Hopkins University, Baltimore, Md. Ströhlein, T. (1970). Untersuchungen über kombinatorische Spiele. Dissertation, Fakultät für Allgemeine Wissenschaften der Technischen Hochschule München. Tamplin, J. (2000). http://chess.liveonthenet.com/chess/endings/index.shtml. Access to Thompson’s 5-man EGTs and maxDTC positions, and to Nalimov’s 3- to 6-man EGTs. Thompson, K. (1986). Retrograde Analysis of Certain Endgames. ICCA Journal, Vol. 9, No. 3, pp. 131-139. ISSN 0920-234X. Thompson, K. (1991). Chess Endgames Vol. 1. ICCA Journal, Vol. 14, No. 1, p. 22. ISSN 0920-234X. Thompson, K. (1996). 6-Piece Endgames. ICCA Journal, Vol. 19, No. 4, pp. 215-226. ISSN 0920-234X. Wirth, C. and Nievergelt, J. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA Journal, Vol. 22, No. 2, pp. 67-80. ISSN 0920-234X.