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.

Their 1989 ICCA paper was criticized by [[Jonathan Schaeffer]] <ref>[[Jonathan Schaeffer]] ('''1989'''). ''Comment on `Distributed Game-Tree Search'.'' [[ICGA Journal#12_4|ICCA Journal, Vol. 12, No. 4]], pp. 216-217</ref>, first on the speedup topic of about eleven on a 16-processor machine not mentioning that parallel speedup is tied to the (in)efficiency of the serial alpha-beta search, and further, on ignoring other work recently done in the field. The YBWC presented was similar to the methods used in the chess programs [[Cray Blitz]] <ref>[[Robert Hyatt]] ('''1988'''). ''A High-Performance Parallel Algorithm to Search Depth-First Game Trees''. Ph.D. Thesis, Department of Computer Science, [[University of Alabama at Birmingham]]</ref>, [[Lachex]], and [[Phoenix|Para-Phoenix]] <ref>[[Jonathan Schaeffer]] ('''1986'''). ''Improved Parallel Alpha-Beta Searching''. Proceedings ACM/IEEE Fall Joint Computer Conference, pp. 519-527.</ref> <ref>[[Jonathan Schaeffer]] ('''1989'''). ''Distributed Game-Tree Searching''. Journal of Parallel and Distributed Computing, Vol. 6, No. 2, pp. 90-114. ISSN 0743-7315</ref>. In a response, Feldmann et al. agreed that the behavior of a parallelization should be measured relative to the "best" sequential program. However, the speedup depends on many implementation details such as those about the hardware, communication mechanism, load-balancing capabilities, etc., which cannot be described in a short paper. The authors further state that chess programs were not the main research vehicle, but the algorithm, which was the reason for not quoting all the chess specific papers <ref>[[Rainer Feldmann]], [[Burkhard Monien]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1990'''). ''Response to a Comment on 'Distributed Game-Tree Search'''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]], pp. 20-21</ref>.

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

* [[Jonathan Schaeffer]] ('''1989'''). ''Comment on 'Distributed Game-Tree Search'''. [[ICGA Journal#12_4|ICCA Journal, Vol. 12, No. 4]]

* [[Rainer Feldmann]], [[Burkhard Monien]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1990'''). ''Response to a Comment on 'Distributed Game-Tree Search'''. [[ICGA Journal#13_1|ICCA Journal, Vol. 13, No. 1]]

* [[Videos#JanGarbarek:Category:Jan Garbarek|Jan Garbarek Group]] - [http://no.wikipedia.org/wiki/Storebror_og_Lillebror Storebror og Lillebror] / Conversation, [https://en.wikipedia.org/wiki/Bergen_International_Festival Festspillene] in [https://en.wikipedia.org/wiki/Bergen Bergen], Norway, May 25, 2002, [https://en.wikipedia.org/wiki/YouTube YouTube] Video: [[:Category: Jan Garbarek|Jan Garbarek]], [https://en.wikipedia.org/wiki/Rainer_Br%C3%BCninghaus Rainer Brüninghaus], [[Videos#EberhardWeber:Category:Eberhard Weber|Eberhard Weber]], [[Videos#MarilynMazur:Category:Marilyn Mazur|Marilyn Mazur]]