Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Scalable Search Test

Author: blass uri

Date: 13:34:16 06/18/00

Go up one level in this thread


On June 18, 2000 at 12:00:08, Ed Schröder wrote:

>On June 18, 2000 at 10:36:40, Gian-Carlo Pascutto wrote:
>
>>On June 18, 2000 at 10:17:08, Ed Schröder wrote:
>>
>>>According Rebel it is a mate in 10.
>>>
>>>Ed
>>>
>>>00:00  07.00  0.81  1.Rxh5 gxh5 2.Rxh5 Kf8 3.Rxh7 Ke8 4.Rh8+ Kd7 5.Qf5+ Kc7
>>>00:01  08.00  2.37  1.Rxh5 gxh5 2.Rxh5 Kf8 3.Rxh7 Ke8 4.Qf5 Kd8 5.Qxf7 Kc8
>>>6.Qxe7
>>>00:03  09.00  2.47  1.Rxh5 gxh5 2.Rxh5 Kf8 3.Rxh7 Ke8 4.Qf5 Kd8+ 5.Qxf7 Kc7
>>>6.Qxe7+ Kc8
>>>00:43  10.00  11.74  1.Rxh5 gxh5 2.Rxh5 Kf8 3.Rxh7 e6 4.Bf6 Ke8 5.dxe6 Qxc4+
>>>6.Qxc4
>>>02:35  11.00  Mate in 10 moves 1.Rxh5 Kf8 Rxh7 2.Ke8 Rxf7 3.Qxc4 Qxc4 4.g5 Rhh7
>>>5.b5 Rxe7+ 6.Kd8
>>
>>I find it interesting to notice that even Rebel has some trouble with this,
>>taking more than 10 times as much time to resolve the 10th ply.
>
>That's pretty normal whith such big score differences (2.47 -> 11.74) as
>search is confrontated with big score fluctuations which causes move
>ordering to collapse. I wouldn't bother too much about it, it's quite
>normal.

Not for all programs.

Chessmaster6000(ss=10) can see a forced mate in only 4 seconds and does not have
a big branching factor

This is normal for chessmaster to see mates clearly faster than other programs
and I think that this is because the other programs do some mistakes in their
search rules.

Uri



This page took 0.01 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.