Author: Mike S.
Date: 19:30:08 10/04/01
Go up one level in this thread
On October 04, 2001 at 16:58:31, Dann Corbit wrote: >On October 04, 2001 at 16:56:23, Ralf Poschmann wrote: > >>My friend had in a tournament an endgame with two bishops against one knight. >>He tried to win this game, but after 50 moves it was a draw by the Fide rules. >>Is this rule also true in computer games, even if both computers use tablebases >>and can see the win of one part after more than 50 moves ? >The 50 non-reversible move rule also applys to computer chess. It seems logical >that an exception would be made for computer/computer matches, but that has not >been done. In this respect it would make sense, that a program which sees it can mate some moves after the 50 move rule could be applied, doesn't claim the draw itself. You can claim a 50 move draw, but you don't have to. I'm not sure if some programs behave like this, but it might earn them some additional half points if the opponent doesn't claim it either for whatever reason (a human might not have the time to check that in a blitz game, or an amateur engine might not even have it implemented yet). The same logic goes for the repetition rule. I have seen that a program did not claim the draw, when the opponent could force the 3rd repetition but was in disadvantage otherwise. I'm not sure at the moment, if every program is clever enough not to claim the draw in such a case. I don't think so. This would be a good idea for a test. Which programs know when *not* to claim the draw... Regards, Mike Scheidl
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.