Computer Chess Club Archives

Search

Messages

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

Author: Robert Hyatt

Date: 14:30:31 09/20/98

Go up one level in this thread

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

• Re: How do hash tables help move ordering? John Coffey 15:03:57 09/20/98
• Re: How do hash tables help move ordering? (Fail Low)? Inmann Werner 14:49:17 09/20/98
  • Re: How do hash tables help move ordering? (Fail Low)? Robert Hyatt 17:58:08 09/20/98
    • Re: How do hash tables help move ordering? (Fail Low)? Inmann Werner 14:25:38 09/21/98
      • Re: How do hash tables help move ordering? (Fail Low)? Robert Hyatt 12:56:44 09/22/98
    • Re: How do hash tables help move ordering? (Fail Low)? David Eppstein 21:12:04 09/20/98
      • Re: How do hash tables help move ordering? (Fail Low)? Robert Hyatt 06:11:47 09/21/98
  • Re: How do hash tables help move ordering? (Fail Low)? Roberto Waldteufel 16:49:57 09/20/98
    • Re: How do hash tables help move ordering? (Fail Low)? Robert Hyatt 17:59:55 09/20/98
      • Re: How do hash tables help move ordering? (Fail Low)? Roberto Waldteufel 07:09:32 09/21/98
  • Re: What is fail low? John Coffey 15:00:47 09/20/98
    • Re: What is fail low? Bruce Moreland 15:53:21 09/20/98
      • Re: What is fail low? greg moller 22:44:39 09/21/98

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.