Author: Andreas Guettinger
Date: 11:05:00 01/03/06
Go up one level in this thread
On January 03, 2006 at 14:01:27, Stuart Cracraft wrote: >On January 03, 2006 at 13:22:57, Andreas Guettinger wrote: > >>On January 03, 2006 at 12:28:09, Robert Allgeuer wrote: >> >>> >>>>It is possible that Sergei introduced the name "history pruning", but the >>>>technique itself is very old; certainly much older than SmarThink. I no >>>>longer remember where or when I heard about it for the first time, but it was >>>>definitely not in this millennium. >>> >>>It would be really interesting where this technique came from, given that it is >>>now in wide-spread use. Maybe a forum member knows... >>> >> >> >>Two papers were it was introduced (1989), probably found on Dann corbits FTP. >> >>- J. Schaeffer, ‘‘Distributed Game-Tree Search,’’ J. of Parallel and Distributed >>Computing 6(2), >>90-114 (1989). >>- J. Schaeffer, ‘‘The History Heuristic and Alpha-Beta Search Enhancements in >>Practice,’’ IEEE >>Trans. on Pattern Anal. and Mach. Intell. 11(11), 1203-1212 (1989). >> >>regards >>Andy > >They are not the same thing. History heuristic does move ordering by >keeping a small table for [from][to] cutoff counts and sorting each >nodes move list based on that global table. > >What the guys are talking about is something else that is not yet >clear to me. By the suggestion that it be called late move reduction >I assume it has to do with the inverse of extension which is reductions, >which I do, but I know nothing about this one. > >Stuart Hm, in this case I'm out of book. The names seems to be confusing after all. regards Andy
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.