Author: Daniel Clausen
Date: 04:57:29 07/28/04
Go up one level in this thread
On July 28, 2004 at 06:27:31, Fabien Letouzey wrote: >On July 28, 2004 at 06:17:53, Daniel Clausen wrote: > >>I get more and more confused. :) > >>I liked the summary Pham gave in his previous post: >>(http://www.talkchess.com/forums/1/message.html?379139) > >>: negascout: >>: 1) Search with full window for the first move >>: 2) Search with zero window for the rest moves (it means from the second move) >>: 3) Research with full window if new value falls out of zero window > >>: pvs: >>: 1) Search with full window if the bestmove has not been found yet (or the >> alpha has not been updated) >>: 2) Search with zero window for the rest moves >>: 3) Research with full window if new value falls out of zero window > >>Do you agree with these "definitions"? If yes, isn't the algorithm Bruce >>mentions (http://www.brucemo.com/compchess/programming/pvs.htm) _exactly_ what >>PVS means? > >>Sargon > >No I don't agree with them at all. >Consider Bruce's definition as his own "cook" and you will be less confused. Done! :) I had Phams post in my mind (it just makes so much sense :) when I read your initial answer to Peter Alloysius. After 'forgetting' Bruce's implementation and re-reading your post again, it makes much more sense to me. Thanks. :) Sargon
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.