Computer Chess Club Archives




Subject: Re: Two mate positions to solve.

Author: Uri Blass

Date: 12:50:44 09/03/00

Go up one level in this thread

On September 02, 2000 at 17:08:20, leonid wrote:

>Please solve these two positions and say minimum number of moves that lead to
> 1r2k2r/1b3pbp/1NPqN1n1/1P1Q4/1P2P3/P3B3/5PP1/R3KB1R White to go.

Qxd6 mate in 6
> 6KQ/3B2Q1/QQQQQQQ1/5Nbn/qqqqq1q1/5qqk/8/8 White to go.

Qgxh5+ mate in 8.
>It will be good if you will indicate all main parameters of your trial. At
>least, I see them this way:
>Name of your program. Hash table size.

Junior5.9(64 mbytes)
>In what way (if you know) position was solved. Selective search or brute force

Selective search(Junior like other top program does not do brute force search.
>Time for each way of search.

7 seconds for the first position.
55 seconds for the second position.
>CPU and its speed.



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.