Author: Ed Schröder
Date: 03:36:04 09/25/04
Go up one level in this thread
On September 25, 2004 at 04:24:46, martin fierz wrote: >aloha! > >i made a small experiment: old root move ordering vs new root move ordering. > >old: >generate all moves. do not order. use normal search and after each completed ply >(or fail high) move the current best move to the top of the list and shift all >moves back. > >new: >generate all moves. do not order. use normal search and after each completed ply >(or fail high) move the current best move to the top of the list and order the >remaining moves by subtree size. > >results on centrino 1.4GHz: >- test set ECMGCP 5s/move: old 107/183 solved, new 103/183 solved > >- matches at blitz 1'+5'' increment vs frenzee & gothmog: >old: 8-32 against gothmog, 21-19 against frenzee >new: 7-33 against gothmog, 20-20 against frenzee This is a terrible way of testing. When it's about move-ordering that will give you a few percent speed increase you don't start to play matches. You just take 200-300 positions, meassure the speed increase and if 60% produce fewer nodes you know you have an improvement. My best, 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.