Author: James Robertson
Date: 18:07:34 10/23/98
Go up one level in this thread
On October 23, 1998 at 20:40:03, Robert Hyatt wrote: >On October 23, 1998 at 00:45:33, James Robertson wrote: > >>On October 22, 1998 at 23:14:56, Robert Hyatt wrote: >> >>>On October 22, 1998 at 21:45:54, jonathan Baxter wrote: >>> >>>>How do chess programs detect perpetual check? Do they just extend on sequences >>>>of checks or do they have specific features to detect likely perpetual >>>>situations? >>>> >>>>Jon >>> >>> >>>I don't do anything special other than checking for repetitions in the usual >>>way. I extend on checks, and again if there is only one legal move to get >>>out of check. Other than that, nothing special in my code at all... >> >>Wasn't Deep Blue unable to detect perpetual check in the second game of it's >>Kasparov return match? And Kasparov then made the foolish mistake of believing >>the computer wouldn't miss something like that? >> >>James > > >Kasparov didn't see it either. It was a full 60 plies of search to see >the repetition... I suppose it is obvious he didn't see it; he didn't play it. :) Many perpetual check positions require many many plies to see them to their conclusion (draw), and yet humans spot them all the time..... James
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.