Author: Bruce Moreland
Date: 16:12:02 09/16/99
Go up one level in this thread
On September 15, 1999 at 19:13:15, leonid wrote: >What is the History Table and Recursive Null? > >Thanks, >Leonid. During a search, situations arise where you have to decide which move to search first. If you search a good move first, you might not have to search the rest. The history heuristic is a means, first popularized and probably invented by Jonathan Schaeffer, of keeping track of moves that have tended to be good. You have a counter (the history counter) for each possible move by every kind of piece, and when you find that a move is good, you increment that counter. Later on, when deciding which moves to search first, you tend to search high history count moves earlier than others. For instance if Nc3-d5 is good here, it might be good next time I can play it, so I'll try it first when I'm searching through moves, unless something else is obviously better (capturing a queen with a pawn or something). bruce
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.