Author: Sergei S. Markoff
Date: 22:18:43 09/26/04
Go up one level in this thread
>wow sergei, you have even more questions than i do :-) :) >now, i have invented (and patented LOL) a new method for root move ordering. > it is a combination of the two above. first, i shift new best moves to the > top of the list. then i order the list based on node count but i only swap > two moves at i,i+1 if the condition >nodecount[i+1] > X*nodecount[i] I have another idea. May be it's better to sort (by nodecount) independently two groups of moves: the moves that was best moves in previous iterations and moves that was not. The first group of moves must be searched first. And also may be it's good idea to add some "expire" function that will decide that move from group 1 now can be transfered to group 2. The easy way is to expire moves which was best for early iterations (root_depth-4, for example). >i need your results to compare :-) I'm experimenting on it :) I will publish my results.
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.