Author: Robert Hyatt
Date: 07:27:27 04/22/01
Go up one level in this thread
On April 22, 2001 at 06:19:30, Alvaro Jose Povoa Cardoso wrote: >You used some new vocabulary terms (to me). >What is a "permanent hash entry" or "position learning value" ? >Is it an hash entry from the current search (as opposed to an hash entry from an >old search) ? > >Thank you, >Alvaro Cardoso Crafty uses position learning as defined by David Slate and Tony Scherzer in an article for the JICCA about 10 years ago. The idea is that if the score at the root drops drastically from one move to the next, you store the result of the "dropped-score-search" in the position learning file. The next time your program reaches the previous position, it will find this entry in the hash table and it will play something else. If you don't do position learning, then simply ignore that part of what I do. if the current position is in either hash table, just stuff the PV move into the entry. If there is no match, stuff a dummy entry into the always-store table with the current PV move but a flag that says "this score is no good" so it won't be used...
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.