Name
Abstract | ||
|---|---|---|
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 requested a KQQKQQ endgame table and was provided with: two by the authors. This paper 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. |
Year | Venue | Field |
|---|---|---|
1999 | ICCA JOURNAL | Simulation,Chess endgame,Champion,Artificial intelligence,Surprise,Engineering,Computer chess |
DocType | Volume | Issue |
Journal | 22 | 4 |
ISSN | Citations | PageRank |
0920-234X | 9 | 1.61 |
References | Authors | |
4 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| E. V. Nalimov | 1 | 15 | 2.40 |
| c wirth | 2 | 9 | 1.61 |
| Guy McCrossan Haworth | 3 | 35 | 17.69 |