Author: Russell Reagan
Date: 00:36:10 11/11/03
Go up one level in this thread
On November 11, 2003 at 02:25:12, Drexel,Michael wrote: >You have to test much more complicated positions where the players have many >equal possibilities. >In the Svidler game black moves were even forced. The alternative was to resign >immediately. I was simply responding to Michael Byrne's claim that you would almost never find two such games by a single player in one year. I found them in the first two games that I looked at, from the same player, in the same tournament. If it was that easy for me to find such games, I don't think it is unreasonable to think that an IM could play a series of moves that a computer did in a few games in one tournament. You can always win your side of the argument if you continually put more constraints on it, as you're doing. "No opening positions. No endgame positions. That game doesn't count because it's not complicated enough. This game doesn't count because it was played on a Tuesday..."
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.