Computer Chess Club Archives

Search

Messages

Subject: Collecting PVs: hashtables vs. lists passing in search

Author: Vladimir Medvedev

Date: 05:30:26 06/18/02

I know that some programs collect PV after search by browsing hashtable, while
others (including my GreKo) do that dynamically in search by passing move lists
(by reference, of course :)) in recursive calls.

I think that the first method (get PV from hashtable) should be better - simply
because we will get only one PV per search and do not waste time for passing
data of no use. But I have two questions before switching to this method in my
program:

1. Is it REALLY much faster? (Did anybody measure the difference?)
2. What about hash collisions and instability?

• Re: Collecting PVs: hashtables vs. lists passing in search Daniel Clausen 05:43:06 06/18/02
  • Re: Collecting PVs: hashtables vs. lists passing in search Richard Pijl 08:41:51 06/18/02
    • Re: Collecting PVs: hashtables vs. lists passing in search Daniel Clausen 09:24:40 06/18/02
      • Re: Collecting PVs: hashtables vs. lists passing in search David Hanley 12:50:42 06/18/02
      • Re: Collecting PVs: hashtables vs. lists passing in search Richard Pijl 10:09:22 06/18/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.