Computer Chess Club Archives




Subject: Fail high reductions

Author: Russell Reagan

Date: 14:34:47 07/01/03

From "Fail High Reductions by Rainer Feldmann"

"...a fail high node is a node 'v' with a search window of [alpha,beta] at which
a static evaluation function 'c' produces a cutoff. The FHR-algorithm reduces
the search depths at these fail high nodes thus searching their subtrees with
less effort."

Their subtrees? I thought fail high nodes didn't have subtrees, and that you
return beta at a fail high node. I must be misunderstanding something. Could
someone give a simple explaination of how fail high reductions work?

This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.