Author: leonid
Date: 05:57:23 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 I am not sure what I use in my logic but it is not nullmove. Actually, many ways that I tryed to speed the search was prone to give too big mistakes. Went to the use of one method where two upper and two highest plys are allways untouched. In the plys in the middle only two lines of code are responsible for speeding. How speedy is my "positional logic" I never actually found. Speeding the logic give advantage to see, for instance, two plys more against the "perfect search" in 6 plys deep thinking. Leonid.
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.