Computer Chess Club Archives

Search

Messages

Subject: Re: Interesting mate test for hashing

Author: Alessandro Damiani

Date: 14:48:55 09/11/99

Go up one level in this thread

On September 11, 1999 at 15:59:19, Ed Schröder wrote:

>On September 11, 1999 at 15:36:18, Robert Hyatt wrote:
>
>>OK... then we are 'in sync' here it seems..
>>
>>As far as PVS, the main advantage is that since almost everything is searched
>>with a null-window, it saves nodes, _IF_ you do well at move ordering (I have
>>no doubt that you do well so PVS might be a win for you too)...
>>
>>It reduced my trees by 10% and loses nothing at all...  unless you screw
>>up move ordering, then it can make the tree bigger as you first search with
>>a null window, then you have to re-search with the normal window...
>
>Thus, PVS is aspiration search with a null-window? Is that all there is?
>
>Ed

I think there is problem with the combination null-window and forward pruning:
forward pruning is not perfect. So there are more wrong cut-offs with PVS than
without. This could affect positional play.

Alessandro

• Re: Interesting mate test for hashing Robert Hyatt 19:25:24 09/11/99
  • Forward pruning and PVS, was Re: Interesting mate test for hashing, Alessandro Damiani 03:38:23 09/12/99
    • Re: Forward pruning and PVS, was Re: Interesting mate test for hashing, Robert Hyatt 07:17:42 09/12/99
      • Re: Forward pruning and PVS, was Re: Interesting mate test for hashing, Alessandro Damiani 13:58:52 09/12/99
        • Re: Forward pruning and PVS, was Re: Interesting mate test for hashing, Robert Hyatt 17:58:56 09/12/99

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.