Author: Eugene Nalimov
Date: 16:36:41 09/11/99
Go up one level in this thread
On September 11, 1999 at 15:59:19, Ed Schröder wrote: >On September 11, 1999 at 15:36:18, Robert Hyatt wrote: > >>OK... then we are 'in sync' here it seems.. >> >>As far as PVS, the main advantage is that since almost everything is searched >>with a null-window, it saves nodes, _IF_ you do well at move ordering (I have >>no doubt that you do well so PVS might be a win for you too)... >> >>It reduced my trees by 10% and loses nothing at all... unless you screw >>up move ordering, then it can make the tree bigger as you first search with >>a null window, then you have to re-search with the normal window... > >Thus, PVS is aspiration search with a null-window? Is that all there is? > >Ed In each node you search all the moves starting from the second one with a null window. (Please node that usually you already have null window). Of course that can be combined with aspiration search - in this case you will search first move with (prev.score-something,prev.score+something), not with (-inf, inf). Eugene
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.