Author: Flemming Rodler
Date: 13:22:26 04/16/00
Go up one level in this thread
On April 16, 2000 at 15:19:32, Georg v. Zimmermann wrote: >Hi there, > >the program I'm working on uses a simple concept : > >KillerMoves are the moves which are best in the same ply most often. > >History is how often one move has been best in the whole search. > >Is this the most common way to use History/Killers ? > >I read in some paper ( I forgot the author sorry ) about SSS and others that the >idea of Killermoves is outdated and almost everyone only uses History today. Is >that correct ? > >What is the best way to see how good my move ordering is ? Should I simply count >how often the move "ordered" as number 1 turns out to be the best move ? > >Thanks, >Georg Hi, Im am quite new to chessprogramming but I have two ideas of how you might test it. 1) Given a position generate the whole search tree to a fixed depth without prunning and count the number of nodes generated. Now compare this number with the number of nodes generated with move ordering and prunning. This should give you a precise ratio of how much you prune for that position and depth. By using different positions and move ordering strategies you can see what works best for you. 2) If the move ordering takes very long to perform it might not be worth the trouble. The above method does not take this into acount. Instead what you can do is to search to a fixed depth with different move ordering strategies and then time them to see how long each took. The fastest is the best. Both methods could be combined. If there are better methods I would also like to learn about them Best regards Flemming Rodler
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.