Author: Dann Corbit
Date: 12:04:26 04/14/04
Go up one level in this thread
On April 14, 2004 at 14:51:25, Peter Fendrich wrote: >On April 14, 2004 at 14:00:47, Dann Corbit wrote: > >>Are there any PVS style programs that store both an upper and lower bounds (and >>I imagine they will also need two depths as well.)? >> >>I am curious to find out if there is value so that I can write a very general >>program where I can switch algorithms at will. > > >It seems to violate the very soul of PVS. Null window in order to get fastest >possible search. Storing lower and upper bounds (you don't mean alpha/beta, do >you?) means other types of search. Well, that's on the one hand. On the other hand, every search except for pv nodes is a null window search like MTD(f) and therefore returns a bound instead of an exact value. I wasn't sure what I might do with the data, but it seems to me that a clever fellow might think of something.
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.