Author: Inmann Werner
Date: 14:49:17 09/20/98
Go up one level in this thread
On September 20, 1998 at 17:30:31, Robert Hyatt wrote: >On September 20, 1998 at 14:21:15, John Coffey wrote: > >>I think that the subject says it all. >> >>John Coffey > > >Yes. You store the best move when you store a position, assuming you >have a best move (you don't if you searched all moves and failed low, >of course.) You should try this move first each time you encounter this >position... Whats the thing with the fail low? Why can I not use the Hash table for move ordering in this case? (I do now!) Werner
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.