Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: 3 mating problems - How much time your programs take?

Author: Andrew Dados

Date: 14:10:00 08/16/00

Go up one level in this thread


On August 16, 2000 at 16:57:08, Jari Huikari wrote:

>[D]3R1B1K/5p2/2p2p2/b1rPNP1n/q1rkNP2/1Pp2Q2/1n6/5B2 W - -
>[D]1B1N4/p2n4/3P1P2/2nk1BP1/P7/N7/K3P2P/1Q6 W - -
>[D]kbb2rr1/1p6/p3p1q1/PN1pB3/1n6/R3Q3/5PB1/6K1 W - -
>
>These were quite hard positions for Nero.
>It needed 143 s. for the first one, 262 for the second and the third
>wasn't yet solved in 12 minutes.
>
>                                       Jari

Mine somehow manages to find all mates below 1 sec; not sure if it sees shortest
mates available (processor is k6-3 450Mhz):

Pos 1: depth 4; nodes 183k; mate in 6;  Qf2
Pos 2: depth 4; nodes  85k; mate in 6;  e4
Pos 3: depth 7; nodes 169k; mate in 8;  Qa7

-Andrew-



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