Author: Zach Wegner
Date: 17:15:00 07/15/04
Go up one level in this thread
On July 15, 2004 at 16:43:39, Andrew Dados wrote: >Consider this: for node to be a fail high (FH) node all its children must fail >low (and all of its children must be searched). >For node to be a fail low (FL) node only one of its children must fail high (so >we stop at first failing high move). This is backwards. If you fail high in a node, you dont search any more moves. You only fail low after all the children are searched and they all failed high.
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.