Computer Chess Club Archives

Search

Messages

Subject: Re: hash collisions

Author: Ricardo Gibert

Date: 06:30:30 07/10/02

Go up one level in this thread

On July 10, 2002 at 04:30:28, Sune Fischer wrote:

>On July 10, 2002 at 01:02:38, Ricardo Gibert wrote:
>
>>I find it fascinating that so many very experienced computer chess programmers
>>do not understand some rather fundamental properties of alpha-beta search.
>>
>>What RH ran into was actually quite predictable. As MF put it, "I'm surprised
>>that you're surprised."
>
>In a PV search some of the nodes are searched twice, so if you get something
>outside the zero window because of a collision, it slows you down as you have to
>research, but it doesn't hurt you unless you get another collision while
>researching.
>
>-S.

This is not a property of using PVS. A normal alpha-beta search plus hash table
does this too.

• Re: hash collisions Sune Fischer 08:04:34 07/10/02
  • Re: hash collisions Ricardo Gibert 17:42:45 07/10/02
    • Re: hash collisions Robert Hyatt 19:04:44 07/10/02
      • Re: hash collisions Ricardo Gibert 21:34:56 07/10/02
        • Re: hash collisions Robert Hyatt 08:40:08 07/11/02
        • Re: hash collisions [correction] Ricardo Gibert 21:52:28 07/10/02

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.