Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Ingo Althöfer. B. Balkenhol: K-reguläre Minimax-Bäume mit distinkten Blattwerten, die bei beliebiger Sortierung "leicht" für den alpha-beta Algorithmus sind. ICGA Journal, 15(2):81, 1992. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: A Game Tree with Distinct Leaf Values which is Easy for the Alpha-Beta AgorithmIngo Althöfer, Bernhard Balkenhol. ai, 52(2):183-190, 1992.
The following publications are possibly variants of this publication: