Computer Chess Club Archives




Subject: Re: Two mate positions to solve.

Author: Larry Griffiths

Date: 03:12:14 09/05/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.
> 6KQ/3B2Q1/QQQQQQQ1/5Nbn/qqqqq1q1/5qqk/8/8 White to go.
>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.

Dont have a name yet, Hash table is 4 meg.

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

Selective Search.

>Time for each way of search.

00:00:23.375  2 -            9000   Nxd4 Bxf6  ?  ?  ?  ?  ?  ?  ?  ?  ?  ?
00:00:31.672  2 -        88888872   Qxg3 Qxg3 Qxh5 Qxh5 Nxd4 Qxe6 Bxe6 Qxe6  ?
?  ?  ?
00:00:52.235  2 -        88888872   Qxg3  <----------

52 seconds for position 2.  My principle continuation is a little messed up
right now but it might be 16 plys deep.

>CPU and its speed.
>If you could come with some of your "crazy" (fantasy) position or normal one, it
>will be good. When you will depose your, try to make them between 5 and 9 moves
>mate. That deep you still can expect reasonable time to be solved by brute force
>on our computers.
>Thanks in advance,


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.