Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Scalable Search Test

Author: Ed Schröder

Date: 07:17:08 06/18/00

Go up one level in this thread


On June 18, 2000 at 07:14:20, Gian-Carlo Pascutto wrote:

>
>Hi all
>
>At the bottom of this post is a test position. The idea is not to check which
>programs find the correct move (should be easy), but when the program first
>spots it, with which score, when it fails high, how long it takes for the
>fail-high to resolve and what score it gets back.
>
>The idea is to see how well the programs handle this kind of positions where
>the extensions suddenly can get wild, just when the alpha-beta window opens.
>Some can handle this very well, other have the search totally blow up...
>
>I've done a bit of testing already, and the results vary rather widely...so
>I'd like to get as much data as possible on this one. If you are a programmer
>yourself, _please_ indicate what extensions your program uses, or other
>relevant info about your search. I'd like to get an idea of the do's/dont's
>when extending.
>
>Also, if anyone has other positions like this (preferrably even harder/worse),
>please share them.
>
>[D] rr4k1/pp2pp1p/q2p2p1/2pP3n/2P5/2BQP2R/PP3P2/2K4R w - - 0 19
>
>PS. Is this a forced mate? If so, how many moves exactly?
>
>--
>GCP

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



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.