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. Beasley J. & Whitworth, T. (1996). Endgame Magic, esp. p. 158. Batsford. ISBN 0-7134-7971-X. Bondar, I. (1998). Four Queen study. Shakhmatnaya kompozitsia No. 22. See also EG No. 137, p. 188 (2000). 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. Elkies, N. (2000). SSSS-Q. EG, No. 137, p. 158. ISSN-0012-7671. 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. Hamlen, J. and Feist, M. (1997). Report on the 15th World Microcomputer Chess Championship. ICCA Journal, Vol. 20. No. 4, pp. 254-255. Haworth, G.McC. (2000). Private communication to Karrer, Nalimov, Rasmussen and Wirth. Space-Efficient Indexing of Chess Endgame Tables 157 Heinz, E.A. (1997). How DARKTHOUGHT plays Chess. ICCA Journal, Vol. 20, No. 3, pp. 166-176. Heinz, E.A. (1999). Endgame Databases and Efficient Index Schemes for Chess. ICCA Journal, Vol. 22, No. 1, pp. 22-32. Heinz, E.A. (2000). Scalable Search in Computer Chess. Vieweg Verlag (Morgan 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. 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. Hyatt, R. (2000). ftp://ftp.cis.uab.edu/pub/hyatt/TB/. Server providing CRAFTY and Nalimov’s EGTs and statistics. ICCA J. Editors (1992). Thompson: All About Five Men. ICCA Journal, Vol. 15, No. 3, pp. 140-143. ICCA J. Editors (1993). Thompson: Quintets with Variations. ICCA Journal, Vol. 16, No. 2, pp. 86-90. Karrer, P. (2000). KQQKQP and KQPKQP≈. ICCA Journal, Vol. 23, No. 2, pp. 75-84. 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. Savin, P.I. and Plaksin, N.M. (1987). The Art of Chess Composition. Kishinev. Stiller, L.B. (1989). Parallel Analysis of Certain Endgames. ICCA Journal, Vol. 12, No. 2, pp. 55-64. 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. Thompson, K. (1991). Chess Endgames Vol. 1. ICCA Journal, Vol. 14, No. 1, p. 22. Thompson, K. (1996). 6-Piece Endgames. ICCA Journal, Vol. 19, No. 4, pp. 215-226. Troitzkiĭ, A.A. (1912). KNNNNKQ Study. Deutsche Schachzeitung. Troitzkiĭ, A.A. (1934). Два коня против пешек (теоретический очерк). Сборник шахматных этюдов, pp. 248-288. Leningrad. [Dva Konya protiv pešek. Sbornik šakhmatnykh étyudov.] Partly republished (1937) in Collection of Chess Studies, with a Supplement on the Theory of the End-Game of Two Knights against Pawns. (trans. A.D. Pritzson), David McKay Company, the latter again re-published (1985) by Olms, Zürich. Wirth, C. and Nievergelt, J. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA Journal, Vol. 22, No. 2, pp. 67-80.