Author: guy haworth
Date: 10:28:04 02/29/00
Go up one level in this thread
There is a write-up of the Kasparov-World Game, and of the KQQKQQ computations done by EN and Christoph Wirth in: the International Computer Chess Assoc. Journal, v22.4 (December '99) The work done by Peter Karrer on KQQKQP~ and KQPKQP~ in connection with that game may well be published shortly. Peter showed that if promotions are P=Q-only, after moves 55. Qxb4, 58...Qe4 and 60...Kc1, Kasparov had mates in 82, 40 and 30 on moves 137, 98 and 90 in the game. He played the last moves optimally whereas the 'World Team' made three sub-optimal moves. G
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.