Author: Vincent Diepeveen
Date: 11:42:41 06/04/01
Go up one level in this thread
On June 04, 2001 at 03:36:25, Rudolf Huber wrote: > >A couple of days ago I said (in a discussion about mtd(f)) that my chess >program can search the starting position to 30 ply over night when the eval >evaluates material only: > >SOS no eval > 1.00 0:00 0.00 1.h3 (2) > 2.00 0:00 0.00 1.h3 (45) > 3.00 0:00 0.00 1.h3 h6 2.h4 (138) > 4.00 0:00 0.00 1.h3 h6 2.h4 (263) > 5.00 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 (435) > 6.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 (1.860) > 7.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 (1.942) > 8.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 (2.024) > 9.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 (5.086) > 10.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 (16.891) > 11.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (41.424) > 12.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (94.654) >463.9 > 13.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (132.293) >497.3 > 14.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (245.124) >505.4 > 15.01 0:00 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (359.203) >533.7 > 16.01 0:01 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (714.937) >593.8 > 17.01 0:02 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (1.212.436) >570.2 > 18.01 0:02 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (1.729.490) >585.4 > 19.01 0:05 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (3.025.316) >605.0 > 20.01 0:08 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (4.700.415) >587.5 > 21.01 0:15 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (9.323.868) >621.5 > 22.01 0:29 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (16.881.247) >582.1 > 23.01 0:48 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (28.659.953) >597.0 > 24.01 1:36 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 (56.472.536) >588.2 > 25.01 3:37 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 >(127.308.632) 586.6 > 26.01 7:41 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 >(275.114.597) 596.7 > 27.01 17:31 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 >(622.179.104) 591.9 > 28.01 45:16 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 >(1.602.666.536) 590.0 > 29.01 80:46 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 >(-1452508008) 586.5 > 30.01 161:28 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 >(1.397.948.590) 587.6 > 31.01 513:07 0.00 1.h3 h6 2.h4 h5 3.g3 g6 4.Rh3 Rh6 5.Rh1 Rh8 >(471.878.568) 573.3 > > >Actually 30 ply was reached after 2:41 hours. > >SW: no search extensions, normal nullmove pruning, normal quiescence > search >HW: 2xCeleron 466 MHz, 500 MByte Hash > > >Can anyone do better? Yes. 30 plies are easy depending upon sorting. The sorting which i use by default in diep doesn't get very deep. 675k for 11 ply i need. Very poor so. The reason is that it will attack when it can, push a pawn forward 2 squares when it can and it will capture anything it sees. If you change move ordering to a) first make stupid pawn moves b) retracting attacked pieces c) only then do captures to good pieces Then you a) get 2 million nodes a second b) search 40 ply easily. Now the problem is of course to find for each position a sorting that's doing all this. Each position requires a different move ordering. the above appears to be good in opening! > >Rudolf
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.