Author: Frank Schneider
Date: 12:47:31 10/28/99
Go up one level in this thread
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 Thanks for your answers! Another idea I had in mind when asking that question was that alphabeta might gain more than PVS from using hashtables that are not cleared between the moves of a game. And singular extensions (or similar techniques) should become simpler, too. Frank
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.