Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: One easy mate to solve.

Author: leonid

Date: 14:23:20 08/21/01

Go up one level in this thread


On August 21, 2001 at 12:49:30, Jim Monaghan wrote:

>On August 21, 2001 at 12:13:11, leonid wrote:
>
>>On August 21, 2001 at 10:15:53, Jim Monaghan wrote:
>
>>Is this mate found by brute force or selective search?
>
>Selective search.
>
>>If this result is of brute force it is close or much better that mine. My
>>computer is Celeron 600. No hash. Time - 6 min 34 sec. NPS - 58k
>>
>>Nine moves are actually minimal number that lead to mate.
>>
>>Selective also found mate in 9 moves in 0.22 sec. NPS - 597k
>
>.22 second! Wow. That's a huge difference between a Cel 300 with 24 MB hash and
>Cel 600 with no hash. Leonid, do you mean 22 seconds?


No 0.22 sec.

But not all the time my selective is so efficent. Everything depend on position.
This is why I say that 10 folds difference, in time for solution, of the same
position by different programs signify that programs gave identical time.

Just today I solved one mate 10 moves deep by my selective and position look as
very innocent. How much do you think my selective took to solve it? One; two
seconds? No!!! Not at all! It took 10 min and 12 seconds. Brute force search was
also pitiful disaster. I will present it my next time.

Leonid.


>Jim



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.