Author: Ed Schröder
Date: 08:25:39 05/28/00
Go up one level in this thread
On May 28, 2000 at 10:02:05, Georg v. Zimmermann wrote: >Hi, > >today I realized that the program I'm toying around with does in its search() > >1.) generate all moves >2.) order the moves and put hash move if available to 1st position >3.) do the recursive search > >I thought that I could increase its speed by testing the hash move first and >only if not >= beta do the move generation and the rest. > >From my tests it shows that it sticks with the hash-move about 50% of the time. >Should this number be higher ? > >I was very dissapointed when I didn't notice any speedup after my changes. What >speedup should I expect ? Something like 0.5-1% or more like 1ply ? I think it depends (for instance) on the size of your eval code. If you have a tiny eval the gain will be a lot higher than the gain of a large eval routine. Or in other words, if your program is mainly in search the gain will be high, if your program is doing a lot of other things the gain will be lower. Ed >Am I doing something wrong or does this simply not matter as much as I thought ? > >Thx for any help, >Georg > > >PS. >when I'm talking about hash move I mean hash move searched to less than current >depth of course.
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.