Author: Peter McKenzie
Date: 11:00:02 04/09/03
Go up one level in this thread
On April 08, 2003 at 19:30:24, Robin Smith wrote: >The following position is a rather trivial (for a human) perpetual check. Why >does it take some programs so long to see it? Many of today's top programs >think White is winning, and after long searches too! Which program detects >perpetual and returns a draw score the fastest? > >Tiviakov,S - Tseshkovsky,V >Kropotkin, 1995 >[D] 6k1/7p/4Q1p1/3pP1P1/p6q/Pp1r2R1/1P5P/7K b - - 0 1 > >Robin Hmmm, my program gives a 'white is winning score' after quite a long search (15+ply). I'm not sure if I have a bug, or if I'm encountering a similar problem to others. The problem here is that white can do a whole bunch of checks and then grab the rook near the tip of the tree. If there isn't much search depth left then the program won't see that black can at least win the rook on d3. Perhaps there are hashing issues at play here? Maybe Q-search issues too...
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.