Author: Dan Newman
Date: 12:22:47 04/18/98
Go up one level in this thread
On April 17, 1998 at 19:23:03, Edward Screven wrote: > >have you considered compacting the move list at beginning of each >search? this would make the move lists short in the endgame, >without requiring insert/remove per capture. > > - edward I have tried this in the past (in an earlier chess engine) and it didn't buy me much. (But I'd do it anyway for the 5-10% in the endgame.) Currently I'm using a different scheme which has heavy weight (48 byte) pieces in doubly linked lists. I remove/restore the captured pieces in the lists at each make/undo. I do a lot of work in make() and undo() and so the added work of linking and unlinking the pieces is only a few percent. In fact make and undo are so expensive that they dominate in cpu usage. My node rate (on a P6/200) is 140 knps near the opening and rises to 166 knps in a KPK endgame. (This is without any real eval other than material.) -Dan.
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.