Author: Ed Schröder
Date: 09:01:22 05/31/00
Go up one level in this thread
On May 31, 2000 at 04:16:44, Roberto Waldteufel wrote: >I am experimenting with some move ordering heuristics and I would like to know >for comparison what percentage of moves proposed and searched by the killer >and/or history heuristic lead to cut-offs in other programs. Many thanks in >advance for any info > >Roberto It depends. It will strongly depend on what you already have in your program. If you (for instance) don't have "the best move from the hash table" in your program the "killer heuristic" will give you a lot more than if you already have the "best move from the hash table". But implement a 2-slot "killer heuristic" by all means. It should give you a clear speed-up. Maybe just 5-10%, maybe a lot more. As already said, it depends. Ed
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.