Computer Chess Club Archives

Search

Messages

Subject: Re: Hash move question

Author: Robert Hyatt

Date: 20:28:50 08/17/01

Go up one level in this thread

On August 17, 2001 at 15:16:54, Alvaro Jose Povoa Cardoso wrote:

>Only now I've implemented the trick of avoiding generating any moves by
>searching the hash move first (if there is one) and bailing out early if this
>move causes a fail high.
>Now, I just don't get the same node counts. I get tree size reductions.
>This is a bug right?
>I should get exactly the same node count, just a litle faster right?
>
>Help appreciated,
>Alvaro Cardoso


Node count should not change.  You did take care of the issue that once
you search the hash move and get no cutoff, you then generate moves and
you do _not_ search the hash move a second time?  If you do, that can
change the node counts...

• Re: Hash move question Koundinya Veluri 11:31:17 08/18/01
  • Re: Hash move question Heiner Marxen 13:33:28 08/18/01
    • Re: Hash move question Robert Hyatt 18:24:34 08/18/01
      • Re: Thanks, I'll try both :) Koundinya Veluri 18:30:32 08/18/01
• Re: Hash move question Alvaro Jose Povoa Cardoso 06:26:38 08/18/01
• Re: Hash move question James Swafford 21:18:53 08/17/01

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.