Computer Chess Club Archives


Search

Terms

Messages

Subject: Killer / History

Author: Georg v. Zimmermann

Date: 12:19:32 04/16/00


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

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.01 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.