Author: Pallav Nawani
Date: 11:10:52 09/28/04
Go up one level in this thread
On September 27, 2004 at 23:45:54, Stuart Cracraft wrote: >I experimented with reordering root ply at iterative depth iply > 1 >where 1 is the root ply, with the results of iply-1 sorted by the >The advantage of sorting root node by subtree is the simplicity. >It eliminates about a half a page of code and introduces >about a quarter page of code for only slightly lesser results >(within 1-2% of my current result) so that is good. > >Still I think I'll leave it #ifdefed out for now and use it as >a baseline that is only improvable upon with handtuning of my >current methods and others to be discovered. > >Stuart By sorting moves at root by subtree nodes I gained a 5-7% reduction in tree size. You should be measuring the reduction in the number of nodes your program was seeing at depth x, and NOT THE RESULTS IN WAC. Regards, Pallav
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.