Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How do hash tables help move ordering?

Author: John Coffey

Date: 15:03:57 09/20/98

Go up one level in this thread


>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...

And you do this move ordering in the middle of the move tree as well and not
just the base of the tree?  (I think that I saw this in the Crafty source code,
but wasn't sure how it worked.)

John Coffey



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.