Author: Gian-Carlo Pascutto
Date: 04:50:29 11/25/00
Go up one level in this thread
On November 25, 2000 at 06:14:12, Bo Persson wrote: >PVS tries to improve on the Negascout by using the best move from a previous >search as the first move at each level. Obviously the odds are very high that >this move is still the best, and the other moves will quickly fail low. Ahem...NegaScout and PVS are the same algorithm, but implemented differently. PVS treats the first move specially, as an exception case, whereas it is blended in in the NegaScout algorithm. NegaScout does search the best move from the previous search first, so it isn't an improvement over PVS. They're equivalent. >This has been taken to the extreme in the MTD(f) search, where even the first >move is searched with a minimal window. You can read about that and also find >some interesting links on Aske Plaat's (old) page This is a tricky simplification. There a many possibilities to do a zero- window search on the first move that aren't MTD(n,f). -- GCP
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.