Author: Ernst A. Heinz
Date: 12:26:55 01/05/00
Go up one level in this thread
Hi Gian-Carlo, >what is the difference between a Principal Variation Search >and the NegaScout algorithm ? > >Everytime I look at them, they seem to do exactly the same >thing, except that NegaScout has a special case if depth > 2, >but because of extensions, you can't use that in a chess program. > >So, what *is* the difference ? The difference is exactly as you say (also regarding usage in real-world programs). =Ernst= P.S. "Scalable Search in Computer Chess" now available at MKP online http://www.mkp.com/books_catalog/3-52805-732-7.asp :-) Visit http://supertech.lcs.mit.edu/~heinz/node1.html for more information about the book.
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.