This is a temporary, read-only recovery of the chessprogrammingwiki while a longer-term plan is worked out. Editing is not possible right now, but will be again soon.
Chess Programming Wiki All pages Other namespaces

Frontier Nodes

Home * Search * Node * Frontier Node

Frontier nodes are interior nodes with leaf-nodes as children, typically being searched in depth-first algorithms at depth of 1. Following the definition of Ernst A. Heinz 1 2, this is where futility pruning might be applied.

See also

References

Up one Level

  1. Ernst A. Heinz (1998). Extended futility pruning. ICCA Journal, Vol. 21, No. 2, ps↩︎

  2. Re: simple node definitions question by Robert Hyatt, CCC, September 13, 2004↩︎

What links here

Contributors: GerdIsenberg.