Author: Tom Kerrigan
Date: 14:53:26 04/11/00
Go up one level in this thread
One additional note to what others have already said: linked lists are really hard on compilers, processors, and memory bandwidth. I've found that if you can keep your data in a sequential array, accessing it is _significantly_ faster, even if you're only dealing with small lists. I changed my piece lists from linked lists to arrays and I believe my program is running ~10% faster because of it. -Tom
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.