Author: J. Wesley Cleveland
Date: 15:14:02 05/10/01
Go up one level in this thread
On May 10, 2001 at 16:48:39, Dann Corbit wrote: >NO big-O stuff in here! I promise! [snip] > >Now the board positions is another matter. Let's suppose that there are only >10^50th distinct board positions, including halfmove clock, castle rights, etc. >We might store those in a linear list, and just have pointers from our tree to >the list. We would have to use 64 bit pointers because of the size of the list >(some other clever indexing method might conceivably reduce this). > >Even if we could use perfect move ordering and only store sqrt(5.28713e9320) >elements in the list, that's still a lot of pointers. > >Or have I missed something. Yes. Each position has the best move (or 1 of the n equal best moves) stored with it.
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.