Author: Pham Hong Nguyen
Date: 20:48:46 07/26/04
Go up one level in this thread
On July 26, 2004 at 19:47:21, Peter Alloysius wrote: >What's the different between negascout and PVS ? They look like the same >algorithm to me. Yes, they are the same BECAUSE some computer chess writters think they are the same ;) I have read that someone has written that Negascout is just another way of implemention of pvs or vice versa. At first glance, they look quite similar: both are based on AlphaBeta, both use aspiration search with zero window, both have to research if new value falls out of this window. However, they differ each other in only small but important detail: first move vs bestmove. 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 In my experiment, pvs can help to save much more nodes than negascout. I think Bruce Moreland did the best discription about pvs in his web. Hope that helps, Pham
This page took 0.01 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.