Computer Chess Club Archives




Subject: Re: 0.05 seconds using PN search...

Author: leonid

Date: 03:29:45 04/23/01

Go up one level in this thread

On April 22, 2001 at 23:40:02, Paul Byrne wrote:

>On April 22, 2001 at 09:57:10, leonid wrote:
>>If you want to solve one mate and say your result, then this is the position:
>>[D]2R2bNn/Rp1n1k1b/1q1ppB1p/1Np1p1p1/2P1P2P/3P2PB/4Q2K/8 w - -
>>If you program says nodes/per/second, please indicate it for this position.
>1W. i=448 n=8398 p=0 d=1000000000 t=0.050
>1W. Bxe6 wins!

The most probable is that your selective search was more effective that mine for
this position. My selective find nothing in 7 moves and only in 8 it solve in
0.11 sec. Celeron 600Mhz. Brute force was very far from glorious. It took 5 min
and 14 sec in seven moves to give a result.

>PN search is typically quite effective on positions like this.  8398 nodes.
>My own program G2K on a 1.2 GHz athlon.

This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.