Author: Ernst A. Heinz
Date: 08:13:36 05/03/00
Go up one level in this thread
Hi William, >In my program my killer table is simply an array of [ply][2] with two killers >allowed per ply. When updating the killer table, I replace the first killer >with the new one (assuming it is not the same move), and move the old first >killer to the second killer position, dropping what ever move is in the second >killer position. > >In the introductory paragraphs of Ernst's book, he describes using counters >to order the killer moves (page 23) >"The killer moves carry "hit" counters with them which specify their priorities >for sorting and replacement." > >This would, of course, require a larger table, and more time spent updating >and sorting the killer table. The space and time overhead you refer to are minimal. Just try it and replace your array of killer moves by an array of killer structs containing the killer move and its associated hit counter. Then increment the hit counters and sort & replace the killer structs according to the fast and easy scheme described by Peter in an earlier post. That is exactly what my text was meant to refer to. =Ernst= P.S. Excerpts from independent reviews of my book are now available at http://supertech.lcs.mit.edu/~heinz/node1.html.
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.