Author: Daniel Clausen
Date: 07:20:42 09/20/02
Go up one level in this thread
On September 20, 2002 at 10:05:58, Ian Osgood wrote: >Index the history table by moving piece and color ( 12 ) and destination ( 64 ) >of the move, instead of the source and destination of the move. This decreases >the size from 4K to <1K entries, which is easier on the cache. Surprisingly, >this has little effect on move ordering performance. In fact, it improved the >node count of my program (better move ordering). > >Ian Ah, an interesting idea. I don't think the 4K->1K decrease helps in my case though, since I have soo many precalculated arrays already. (using rotated bitboards) But I will try it in my engine, as soon as I have some time. Thanks! :) Sargon
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.