Author: Robert Hyatt
Date: 15:06:12 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 ? No it isn't. Technically history moves provide everything killer moves provide, and then some. But a plus for killers is that you can try them before generating any moves, and if you get a cutoff due to the killer, you avoid the move generation completely. History doesn't let you do this as the data structure doesn't contain moves... > >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 That is a good approach. I do this in Crafty, and average 92%. That is, 92% of the time, when I get a fail high, it is on the first move searched. > >PS. >Why do I get so few responses on my post while very qualified programers jump on >posts like "Whats the optimal hash table size ...?" Am I asking too simple >questions ? Sorry I don't know better.
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.