Location of Repository

KQQKQQ and the Kasparov-World Game

By Eugene V Nalimov, Christoph Wirth and Guy McCrossan Haworth


The 1999 Kasparov-World game for the first time enabled anyone to join a team playing against a World Chess Champion via the web. It included a surprise in the opening, complex middle-game strategy and a deep ending. As the game headed for its mysterious finale, the World Team re-quested a KQQKQQ endgame table and was provided with two by the authors. This paper \ud describes their work, compares the methods used, examines the issues raised and summarises the concepts involved for the benefit of future workers in the endgame field. It also notes the contribution of this endgame to chess itself

Publisher: The International Computer Games Association
Year: 1999
OAI identifier: oai:centaur.reading.ac.uk:4564

Suggested articles



  1. (1986). A Data Base on Data Bases.
  2. (1995). and the Editorial Board
  3. (1993). Chess Art in the Computer Age.
  4. (1979). Computer Analysis of a Rook End-game.
  5. (1999). Endgame Databases and Efficient Index Schemes for Chess.
  6. (1996). Endgame Magic.
  7. (1999). Extract of games from Fatbase. Private communication.
  8. (1995). Harnessing Computational Resources for Efficient Exhaustive Search. ETH(Zürich) doctoral thesis, see http://nobi.inf.ethz.ch/ralph/.
  9. (1999). Kasparov-World post-game commentary and analysis based on contemporary notes.
  10. (1974). Ob Analize Ferzevogo Endshpilia pri Pomoshchi EVM. Problemy Kybernet,
  11. (1999). Results from KQP(g5+)KQP(d6-)≈. Private communication.
  12. (1994). Solving Large Retrograde-Analysis Problems Using a Network of Workstations.
  13. (1996). Solving Nine Men’s Morris. Games of No Chance
  14. (2000). Space-Efficient Indexing of Endgame Databases for Chess.
  15. (1999). The 9th World Computer-Chess Championship: the Search-Engine Features of the Programs.
  16. (1999). The 9th World Computer-Chess Championship: the Tournament.
  17. (1985). The Connection Machine.
  18. (1985). The Construction of an Omniscient Endgame Database.
  19. (1998). the Kasparov-World Game 207
  20. (1999). The Kasparov-World Match.
  21. (1997). The Legitimacy of Positions in Endgame Databases.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.