Author: Andreas Stabel
Date: 02:20:06 09/21/99
Go up one level in this thread
On September 20, 1999 at 18:17:20, Dann Corbit wrote: >On September 20, 1999 at 11:53:07, Shep wrote: >>On September 20, 1999 at 11:05:05, Andreas Stabel wrote: >> >>>1. no promoted pieces, without promotion moves: 109 white moves (W.Cross 1967) >>>2. no promoted pieces : 144 white moves (J.Ban 1960) >>>3. with promoted pieces : 218 white moves (Dickins 1968) >>>4. with all 32 pieces : 99 white moves (HH.Cross 1946) >>> >>>1. 5k2/2K5/3N1B1P/P1NB4/6Q1/4R3/P1PP1P1P/1R6 w - - 0 1 >>>2. n1r1r1b1/1P1P1P1P/1Q6/3NBNK1/R7/4p1p1/3PBPkP/2R5 w - - 0 1 >>>3. 3Q4/1Q4Q1/4Q3/2Q4R/Q4Q2/3Q4/1Q4Rp/1K1BBNNk w - - 0 1 >>>4. q2Q3r/n6R/kpB1N1K1/p1p1Bppp/1PN3P1/1n1pp1b1/P1PPPP1P/r5Rb w - - 0 1 >>> >>>Theese positions may break several chess engines :) >> >>#3 broke every one I tried about 1 year ago: Crafty, MChess, Fritz, ... :) > >Crafty zips right through them now. I suggest that 256 is probably a reasonable >limit for holding possible moves. It fits in an unsigned char for storing the >count. If we have some enormous array of objects that is a function of the move >count, it might be wise to try to trim it though. > I've scanned through the whole granit collection of games, containing a total of 1496327 games and 111941117 moves. The maximum number of legal moves in any position in theese games were only 92, so I think 128 should be more than enough for ordinary chess games. Regards Andreas Stabel
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.