Author: Andrew Williams
Date: 15:08:38 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 ? > In general, you're interested in nodes where you can get an early cutoff. So increment a counter every time you get a beta cutoff. Increment a separate counter every time you get this beta cutoff is achieved on the FIRST move you are searching at a given node. In other words, what you want to know is "in what percentage of cases where I can stop the search early am I able to stop it after searching exactly one move?". In very general terms, you are aiming to get this percentage above 90%. >Thanks, >Georg > >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. I don't know. But this is a friendly place. If you don't get an answer, just ask again :-) Andrew
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.