Author: Mridul Muralidharan
Date: 20:31:38 01/04/04
Go up one level in this thread
On January 04, 2004 at 02:57:24, Daniel Shawul wrote: >Hello > >i use arrays to store moves in my chess program. >the maximum array size is 80.but i found out that >in some positions this is not true.what number is do you >think suitable.Or should i use stacks instead. > >regards >daniel You would be better off using a global array per search tree instead of an array per node (a stack like implementation). There would be significant space savings and your tree would be much lower in size (If you use a tree structure per node that is). I use : Move next_move_tree[MAX_PLY_DEPTH * 70] - MAX_PLY_DEPTH in my program is 128. Chances of this getting full is like astronomical - and I generate only legal moves , not pseudo legal. Regards Mridul
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.