Author: Pham Minh Tri
Date: 20:49:35 08/12/01
Go up one level in this thread
On August 10, 2001 at 17:39:02, Robert Hyatt wrote: >On August 10, 2001 at 11:45:32, Erik Evenson wrote: > >>I'm just starting to implement move ordering in my chess program and have a >>quick question: >> >>The first factor in move ordering I am incorporating is using previous search >>evaluation results. Currently, my transposition table stores a postion's >>evaluation (int), evaluation depth (int), and a hashlock (long). >> >>Q: Should I be storing the possible moves and resulting new position evaluation >>as well? This would seem to speed up subsequent searches (no need to move gen >>or evaluate if sufficient depth), but redundantly stores the evaluation (in the >>move and in the next position. In addition, I would structure this as a list in >>each hashtable entry, so now my hash table is growing pretty fast... > >You should store the best move for EXACT entries. This comes from the current >PV you are backing up. You should store the current move for LOWER positions, >as the current move is causing a fail high and should do it again the next time >you search it. How about the UPPER? Should we choose the move has score nearest alpha (the highest score or the first of highest ones)? Perhaps store something is better than nothing. > > > > > >> >>How does everyone else do this? >> >>TIA.
This page took 0.01 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.