Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How long does it take your program to find this simple mate in 4?

Author: Robert Hyatt

Date: 08:17:52 02/09/00

Go up one level in this thread


On February 09, 2000 at 00:31:28, Peter W. Gillgasch wrote:

>On February 08, 2000 at 23:57:54, Robert Hyatt wrote:
>
>>It doesn't appear to be a bug.. just that on the fail high, some mates that
>>were pruned suddenly become "ok".  And move ordering just happens to follow
>>an incredibly deep series of checks first.  IE it finds a mate in 15 or so
>>very quickly then tries to improve.  But in doing so, it searches a _bunch_
>>of stuff.  Just runaway extensions, mainly.
>
>OK. It is not a bug. Let´s call it a f* up then 8^)
>
>In any case you should look into this for obvious reasons...
>
>-- Peter


I did...   there is nothing I can do.  Crafty just _happens_ to pick the wrong
check to look at first, and it follows a line that leads to a forced mate in
15 moves, but it takes a while to find this.  Then it tries other moves and
finds shorter mates after burning a lot of time.  Without beta=+inf, the deep
mate gets pruned instantly, hence the fail high at 1 second.  It then takes
almost 2 minutes to get a score back.  Sometimes move ordering is simply
unlucky, other times I get a mate instantly while others take a long while...



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.