Author: leonid
Date: 04:12:14 07/06/01
Go up one level in this thread
On July 05, 2001 at 10:03:11, Heiner Marxen wrote: >On July 03, 2001 at 09:13:39, leonid wrote: > >>On July 03, 2001 at 05:47:02, Angrim wrote: >> >>>On July 02, 2001 at 15:10:18, leonid wrote: >>> >>>>Hi! >>>> >>>>This mate could be fun to resolve: >>>> >>>>[D]R1N1N2k/2qqqqbb/1nQ2q1r/2Q2qQ1/1nQ2q2/1QQQQq1r/1BB5/K5QR w - - >>>> >>>>Please indicate your result. >>>> >>>>Thanks, >>>>Leonid. >>>proved that move g5xg7 wins, 11 turns >>>PN2:2020634 evals, 39222 expands, 13.15 seconds >> >> >>Excellent time! Only what is "one turn"? One move? >> >>I do ask this because my program found that mate existe between 12 and 9 moves. >>First 8 moves my program looked by brute force. Mate was found in 12 by >>selective. If your result signify that mate was found in 11 moves then shortest >>mate is between 9 and 11 moves. >> >>Leonid. > >Chest says "No solution in 9 moves", using 69.4 minutes on a K7/600 with >350 MB hash. I have started depth 10, but it will need 10 hours or more. > >Heiner Good no know! I see that on this position my branching factor started at decent 5.9 between 4 and 5 moves (I speak about brute force) and ended 16.19 between 7 and 8 moves. This is where hash should make nice difference. My 8 moves brute force was already 1 hour and 39 min. Cheers, Leonid.
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.