Computer Chess Club Archives

Search

Messages

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

Author: Peter W. Gillgasch

Date: 21:31:28 02/08/00

Go up one level in this thread

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

• Re: How long does it take your program to find this simple mate in 4? Robert Hyatt 08:17:52 02/09/00
• Re: How long does it take your program to find this simple mate in 4? Dann Corbit 21:49:07 02/08/00
  • Re: How long does it take your program to find this simple mate in 4? Dave Gomboc 22:13:59 02/08/00
    • Re: How long does it take your program to find this simple mate in 4? Colin Frayn 01:55:21 02/09/00

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.