Author: Ed Schröder
Date: 09:28:36 09/28/99
Go up one level in this thread
>Posted by Bas Hamstra on September 28, 1999 at 08:04:10: > >Hi Ed, > >Some measure the quality of movesorting as follows: > >a) count the total nr. of fail highs >b) count the total nr. of FH's at the first move > >b/a represents the goodness of movesorting. Bob reports 94%. A friend of mine >reports > 90%. I still have to measure, will soon. > >But I am not sure this is the most advanced test there is. It seems that >movesorting near the root is VERY important for the total nodes searched, >while near the leafs this is much less important. I would like to know *how* much >less, but have no idea. > >Anyway, if that is true, this b/a number doesn't take that into account. Since >most nodes are near the leafs you don't get a clue about the movesorting of >nodes near the root, where it is most important... > >Regards, >Bas Hamstra. Here is what I do (in a nutshell)... #1. Sort the move-list after each iteration. #2. Make sure that the order of the moves (after the first iteration) doesn't change much unless there is a very good reason for that. Ed
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.