Author: Christophe Theron
Date: 19:06:12 10/27/99
Go up one level in this thread
On October 27, 1999 at 21:55:31, Robert Hyatt wrote:
>On October 27, 1999 at 15:38:54, Frank Schneider wrote:
>
>>Hi all,
>>
>>this is a question about the searchalgorithms used by other programs.
>>Many programs and also Gromit seem to use PVS or MDT(f) which both use
>>nullwindow-searches.
>>Is there anyone using a search that doesn't do nullwindow searches?
>>Why? Why not?
>>
>>
>>Frank
>
>
>I doubt any single person can answer your question about who does PVS and who
>does pure alpha/beta, because each author would have to speak up about his
>code. But the reason _for_ using PVS is that it saves at least 10% in time/
>nodes over non-PVS searches on average, and at times it saves a lot more.
>
>I've been using it since 1978...
I use both PVS *and* simple alphabeta in Chess Tiger. I got a speedup from
detecting where PVS was good and where AB was better...
Christophe
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.