Author: Tom Kerrigan
Date: 14:16:17 01/30/03
Go up one level in this thread
On January 30, 2003 at 15:52:58, Dann Corbit wrote: >3. Using the hash existance to order the moves. Not sure what you mean by this. BTW, a huge win is to use a precomputed table in attack() to see if it's possible for a piece X on square Y to attack square Z. -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.