Author: martin fierz
Date: 01:24:46 09/25/04
Go up one level in this thread
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 (i really shouldn't be testing against gothmog, it's way too strong for my engine, but i believe you learn more from losses than wins and this is a good way to generate lots of losses...) conclusion: the "improved" new root move ordering did worse both in matches and in the test set. obviously the difference is far from significant and more games would be needed to prove anything. but overall i am a bit disappointed that it didn't do better in any of the 3 tests. 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.