Author: Tom King
Date: 14:13:28 08/05/99
Go up one level in this thread
On August 04, 1999 at 20:00:49, Robert Hyatt wrote: [snip] > > >I find the following: > >using SEE to order captures in the q-search, without eliminating any, will >shrink the tree about 10% over using something simple like MVV/LVA. But the >SEE code will likely cost you more than 10% (unless you are a bitmap program >where this can be done fairly efficiently). > >using SEE to eliminate losing captures can speed you up another 50%, or a factor >of two, which is very significant. And no matter how slow your SEE code is, >that become a 'winner' of an idea. I'm seeing a big speedup - it's just the (possible) loss of accuracy which concerns me. Having said that, my Q search is pretty "quick and nasty" anyway, although I do still do things like probe the hash tables.
This page took 0.02 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.