Author: Tom Kerrigan
Date: 18:18:20 10/24/01
Go up one level in this thread
On October 24, 2001 at 17:30:12, Dan Andersson wrote: >??? Tablebase lookups, Pawn Hashes, History, Killer. Especially Tablebase >lookups decide the tree shape. And stalls the execution pipeline. You only do tablebase lookups for a small percentage of searched nodes, and from what I know of tablebase lookups, the bottleneck there is the disk, not main memory. The important entries of the pawn hash table, the history array, and the killer array all fit into cache. Again, no main memory lookups. For the vast majority of nodes, the only memory access you will have to do is one burst read and one burst write for the main hash table, and the write probably doesn't cost you anything. That makes memory pretty close to inconsequential. To confirm this, just look at the SPEC scores for Crafty and observe that they scale (nearly) perfectly with clock speed. -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.