Author: martin fierz
Date: 00:07:59 09/26/04
Go up one level in this thread
On September 26, 2004 at 00:51:17, Sergei S. Markoff wrote:
>Some ideas on hash move extensions.
>The idea was invented independently by Shpeer, Rybinkin ("Mirage") and me. In
>most cases this is a good idea to extend TT moves to improve search stability.
>But what scheme will be best for doing it?
>
>In ST the method is a little curious.
>
>TT_extesion_amount=INCPLY/RootDepth (in plies).
>while(TT_extesion_amount*RootDepth<INCPLY) TT_extesion_amount++;
>
>Anyway it improves play of ST.
>
>I need your results to compare.
in my checkers program, i extend movelist[0] by 1/4 ply, if i have a good reason
to trust movelist[0] (either hashmove or IID-move). i therefore claim to have
invented this method independently too :-)
it works great for me in checkers. in my chess program all my attempts to use
fractional plies have so far been horrible, i wonder if something breaks in my
program when i use them...
anyway, your idea to make the extension depth-dependent is interesting, i should
play with that in the checkers program!
cheers
martin
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.