KQQKQQ and the Kasparov-World Game

Downloads

Arlazarov, V.L. and Futer, A.L. (1979). Computer Analysis of a Rook End-game. Machine Intelligence 9 (eds. J.E. Hayes, D. Michie and L.I. Mikulich), pp. 361-371. Ellis Horwood Ltd., Chichester, England. ISBN 0-853-12112-5. 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-164. Beasley, J. and Whitworth, T. (1996). Endgame Magic. Batsford, London, UK. ISBN 0-713-47971-X. Dekker, S.T., Herik, H.J. van den and Herschberg, I.S. (1989). Perfect Knowledge and Beyond. Advances in Com-puter Chess 5 (ed. D.F. Beal), pp. 295-312. Elsevier Science Publishers, B.V., Amsterdam, The Netherlands. ISBN 0-444-87159-4. Edwards, S.J. and the Editorial Board (1995). An Examination of the Endgame KBNKN. ICCA Journal, Vol. 18, No. 3, pp. 160-168. Elkies, N.D. (1993). Chess Art in the Computer Age. American Chess Journal, Vol. 1, No. 2, pp. 48-52. Feist, M. (1999). The 9th World Computer-Chess Championship: the Tournament. ICCA Journal, Vol. 22, No. 3, pp. 149-159. Gasser, R. (1995). Harnessing Computational Resources for Efficient Exhaustive Search. ETH(Zürich) doctoral thesis, see http://nobi.inf.ethz.ch/ralph/. Gasser, R. (1996). Solving Nine Men’s Morris. Games of No Chance (ed. R.J. Nowakowski), pp. 101-113. MSRI Publications, v29, CUP, Cambridge, England. ISBN 0-521-64652-9. KQQKQQ and the Kasparov-World Game 207 Haworth, G.McC. and Velliste, M. (1998). Chess Endgames and Neural Networks. ICCA Journal, Vol. 21, No. 4, pp. 211-227, esp. p. 212. Heinz, E.A. (1999). Endgame Databases and Efficient Index Schemes for Chess. ICCA Journal, Vol. 22, No. 1, pp. 22-32. 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. Hillis, W.D. (1985). The Connection Machine. The MIT Press, Cambridge, USA. ISBN 0-262-08157-1. Hyatt, R. (1999). ftp://ftp.cis.uab.edu/pub/hyatt/. Server for CRAFTY and Nalimov’s EGTs. Karrer, P. (1999). Results from KQP(g5+)KQP(d6-)≈. Private communication. Komissarchik, Z.A. and Futer, A.L. (1974). Ob Analize Ferzevogo Endshpilia pri Pomoshchi EVM. Problemy Ky-bernet, Moscow Vol. 29, pp. 211-220. Reissued in translation under the title ‘Computer Analysis of a Queen End-game’. ICCA Journal, Vol. 9, No. 4, pp. 189-198. Krush, I. and Regan, K. (1999). Kasparov-World post-game commentary and analysis based on contemporary notes. http://www.smartchess.com/SmartChessOnline/SmartChessOnline/archive/MSNKasparov/. Lake, R., Schaeffer, J. and Lu, P. (1994). Solving Large Retrograde-Analysis Problems Using a Network of Work-stations. Advances in Computer Chess 7 (eds. H.J. van den Herik, I.S. Herschberg and J.W.H.M. Uiterwijk), pp. 135-162. University of Limburg, Maastricht, The Netherlands. ISBN 90-621-6101-4. Lindner, L. (1991). New Ideas in Problem-Solving and Composing Programs. Advances in Computer Chess 6, (ed. D.F. Beal), pp. 97-116. Ellis Horwood Ltd., London, UK. ISBN 0-130-06537-4. Lippold, D. (1997). The Legitimacy of Positions in Endgame Databases. ICCA Journal, Vol. 20, No. 1, pp. 20-28. Marko, P. and Haworth, G.McC. (1999). The Kasparov-World Match. ICCA Journal, Vol. 22, No. 4, pp. 236-238. Mobley, C. (1999). http://chess.clickpharmacy.com. Access to Nalimov’s 4Q EGT, now discontinued. Monkman, F. (1999). Extract of games from Fatbase. Private communication. Nalimov, E.V. and Heinz, E.A. (2000). 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. PCCC (1999). http://www.sci.fi/~stniekat/pccc/codex.htm. The Permanent Commission of the FIDE for Chess Composition’s Codex for Chess Compositions. Pospíšil, J. (1973). Endgame Study #1359. Schakend Nederland, Vol. 80, No. 10, p. 172. Pospíšil, J. (1976). Endgame Study #1476. Schakend Nederland, Vol. 83, No. 5, p. 88. Rusinek, J. (1994). Selected Endgame Studies, vol. 3: Almost Miniatures: 555 Studies with Eight Chessmen. Uni-versity of Limburg, Maastricht, The Netherlands. 208 ICCA Journal December 1999 Stiller, L.B. (1992). KQNKRR. ICCA Journal, Vol. 15, No. 1, pp. 16-18. Stiller, L.B. (1995). Exploiting Symmetry of Parallel Architectures. Ph.D. Thesis, Department of Computer Sci-ences, The John Hopkins University, Baltimore, Md. Stiller, L.B. (1996). Multilinear Algebra and Chess Endgames. Games of No Chance (ed. R.J. Nowakowski), pp. 151-192. MSRI Publications, v29, CUP, Cambridge, England. ISBN 0-521-64652-9. Tamplin, J. (1999). http://chess.liveonthenet.com/chess/endings/index.shtml. Access to Thompson’s 5-man EGTs and maxDTC positions, and to Nalimov’s 5- & 6-man EGTs. Thompson, K. (1986). Retrograde Analysis of Certain Endgames. ICCA Journal, Vol. 9, No. 3, pp. 131-139. Thompson, K. (1990). KQPKQ and KRPKR Endings. ICCA Journal, Vol. 13, No. 4, pp. 196-199. Tsaturjan, V. (1999). http://www.clubkasparov.ru/news/digest/digest029_e.htm. A KQQKQQ subline. Wirth, C. and Nievergelt, J. (1999). Exhaustive and Heuristic Retrograde Analysis of the KPPKP Endgame. ICCA Journal, Vol. 22, No. 2, pp. 67-80. WWW Computer Chess Club (1999). http://www.icdchess.com/ccc.html.