Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: triangular pv vs. hash move pv

Author: Charles Roberson

Date: 08:17:35 09/11/04

Go up one level in this thread


  This discussion brings out an interesting thought. I agree with all of
  Bob's statements, but how about a change of use?

   Lets assume a single stage cache and replacement scheme of
   current depth > previous depth. Also, we have a collision test to ensure
   we really are on the same position.

   Now, the PV is set but in a later tree branch one of the PV positions
   is overwritten due to greater search. True this changes the PV from what
   you originally setup but there may be a positive side effect of this.

   If we only allow the last few moves of the PV to be changed by hash
  replacement(I can think of two ways to do this) then wouldn't we get better
  moves for the PV tail? Thus, improve move ordering for the next iteration due
  to a somewhat better PV?

  Charles

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.