Author: Matthias Gemuh
Date: 04:33:14 03/18/02
Go up one level in this thread
On March 18, 2002 at 07:01:49, Travers Waker wrote: >Hi all programmers. > >I've been wondering: How big do people make their move list (i.e. the list of >legal/pseudo-legal moves in a particular position)? I assume that most people >don't want to use a dynamic list (e.g. linked list), because it's slow, but if >you allocate an array as your list, what length do you make it? It's easy for >captures, since their can only be 16 possible captures (if you allow capturing >the king), but non-captures are not so easy, I think. If you take a guess about >what the greatest number of possible non-captures is in any legal chess >position, how do you know your program won't crash in certain unusual positions? > >Looking forward to hearing your ideas. > >Travers I allocate space for 10000 moves and use it with a dynamic pointer. Even a year at analyzing a position should not need so much space. Maybe I want to analyze for several years :). Regards, Matthias.
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.