Computer Chess Club Archives

Search

Messages

Subject: Hash move question

Author: Alvaro Jose Povoa Cardoso

Date: 12:16:54 08/17/01

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

• Extensions problem (maybe) Alvaro Jose Povoa Cardoso 06:23:13 08/18/01
  • Re: Extensions problem (maybe) Robert Hyatt 07:10:25 08/18/01
• Re: Hash move question Robert Hyatt 20:28:50 08/17/01
  • 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
• Re: Hash move question James Swafford 19:36:35 08/17/01
  • Re: Hash move question Robert Hyatt 20:29:59 08/17/01
    • Re: Hash move question James Swafford 21:16:29 08/17/01
      • Re: Hash move question Bob Green 21:27:04 08/17/01
        • Re: Hash move question Robert Hyatt 22:21:30 08/17/01
          • Re: Hash move question Bob Green 08:49:53 08/18/01
            • Re: Hash move question Robert Hyatt 18:29:35 08/18/01
          • Re: Hash move question Bo Persson 04:26:18 08/18/01

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.