Author: Robert Hyatt
Date: 09:44:24 11/10/03
Go up one level in this thread
On November 10, 2003 at 09:31:50, Bob Durrett wrote: >On November 10, 2003 at 05:00:20, José Carlos wrote: > >>On November 10, 2003 at 04:44:10, Jouni Uski wrote: >> >>>Hard for Ruffian (P4 2,4 GHz), not found in 20 minutes, BUT after executing >>>move sees very fast, that white is mated! Null move problem? >>> >>>Jouni >> >> I don't know for Ruffian, but I guess it's the same reason than for my >>program: in the initial position, the program must search a lot of moves of >>queen and rook, so it takes a while to search deep enough, but if you take the >>rook, gxf3 is forced and then there's a pawn ending, where it's much faster to >>search very deep. >> My program Anubis finds it in ply 22 after forcing Qxf3, very quicky, but from >>the initial position, after some minutes, it's still in depth 16, so it will >>take a long time to get the needed 23 plies (probably less due to extensions, >>maybe like 20 or 21). >> >> José C. > >Since chess engines in general are supposed to be weak at finding sacrificial >lines, perhaps the programmers should do something to minimize the problem. In >this case, having the sacrifice looked at first might have saved some time. > >Bob D. It would hurt. You would get a score for the Qxf3 move, then immediately find that other moves are better and have to compute a score for one of them. You could only do this on the iteration you are going to change your mind on, and there is no way to know that in advance.
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.