Author: Uri Blass
Date: 07:15:50 09/20/02
Go up one level in this thread
On September 20, 2002 at 10:05:58, Ian Osgood wrote: >On September 20, 2002 at 03:53:56, Daniel Clausen wrote: > >>On September 19, 2002 at 20:45:45, Ian Osgood wrote: >> >>[snip] >> >>>6. Experiment with different history tables (I had never heard of indexing by >>>piece*destination until recently.) >> >>Me neither. What is it? >> >>Sargon > >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 Why surprisingly? It is something logical to expect. Uri
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.