Author: Robert Hyatt
Date: 09:15:07 08/31/01
Go up one level in this thread
On August 31, 2001 at 11:15:33, Steve Maughan wrote: >Bob, > >>>Or are you defining a PV search as any search that could result in a PV from >>>the root? > >>Yes to your last question. This is a "hard" search to do, and without good >>move ordering, it becomes harder still. Hence the internal iterative deepening >>to help it out. > >OK. If this the case then can't you detect a PV node as: > > PV When (beta-alpha)>1? > >Regards, > >Steve Not quite. This will think that when you are searching some non-PV move deep in the tree, but below the first move at the root, and you fail high on that move, you would have that case. I'm not sure (without thinking about it a lot) that I want to trigger IID everywhere this happens. Right now what I do is probably overly conservative...
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.