Author: Gian-Carlo Pascutto
Date: 14:24:29 05/30/00
Go up one level in this thread
On May 30, 2000 at 14:54:28, Tom Kerrigan wrote: >I assume that when Bob says he expects a 25% hit rate, he means 25% of the >times that the hash table is probed, and not 25% of the nodes. Probably yes, so did I... >Which means that more work needs to be done to estimate the speedup from the >optimization that started this thread, i.e., the equation becomes: > >speedup = (% hit rate) * (% hash probes) * (% hash move cutoffs) * (% of time >spent doing move generation) > >Throwing in some extremely optimal numbers, the result is: > >0.5 * 0.2 * 0.5 * 0.2 = 1% > >So I think the best you can hope for is 1%. Seems like too much work for too >little, to me. If you do the same optimization for killer moves, how much can you hope for then ? This would be (killer move cutoffs) * (time doing move generation), right ? The second term is pretty high for me, so I'm interested to know what the first one will be. Anybody got any numbers on this ? -- GCP
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.