Changes

a basic concept for a parallel [[Alpha-Beta|alpha-beta search]] coined by [[Rainer Feldmann]] et al. in 1986 <ref>[[Rainer Feldmann]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1986'''). ''A Local Area Network Used as a Parallel Architecture''. Technical Report 31, [[Paderborn University of Paderborn]]</ref>, introduced 1989 to a wider audience in the [[ICGA Journal|ICCA Journal]] paper ''Distributed Game-Tree Search'' <ref>[[Rainer Feldmann]], [[Burkhard Monien]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1989'''). ''Distributed Game-Tree Search''. [[ICGA Journal#12_2|ICCA Journal, Vol. 12, No. 2]], pp. 65-73</ref>. Brothers are [[Sibling Node|sibling nodes]], the oldest brother is searched first, younger brothers, to be searched in parallel, have to wait until the oldest brother did not yield in a [[Beta-Cutoff|beta-cutoff]] and did possibly narrow the [[Bound|bounds]] in case of an alpha increase.

* [[Rainer Feldmann]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1986'''). ''A Local Area Network Used as a Parallel Architecture''. Technical Report 31, [[Paderborn University of Paderborn]]