Author: Leen Ammeraal
Date: 04:03:41 07/26/02
Go up one level in this thread
On July 26, 2002 at 05:30:37, Russell Reagan wrote: > >In your expert opinion, do you think that the time it takes to allocate the >small amount of memory for a move list is going to make a big difference in >playing strength of the engine? I have no idea how much time it takes to >allocate memory so I can't really form an opinion. The time required for allocation is independent of the size, I think. But I thought you wanted to allocate a vector for each call to your search function. When I tested 'allocate', some years ago I admit, room for 256 vector elements were allocated, which is much more than the average number of moves. So the approach with one global array is more efficient wrt space; more importantly, it will also be more efficient wrt to time. But I admit that I don't know if this is a serious waste of time or not. Leen
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.