FIVE VISUALISATIONS OF THE K-BEST MODE

Article type: Research Article

Authors: Althöfer, I.¹ | de Koning, J.² | Lieberum, J.³ | Meyer-Kahlen, S.¹ | Rolle, T.¹ | Sameith, J.¹

Affiliations: Jena, Germany

Note: [1] Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, 07740 Jena – Gemiany. Email: {althofer,falox}@minet.uni-jena.de, [email protected], [email protected].

Note: [2] Roland Holstlaan 581, 2624 HR Delft, The Netherlands. Email: [email protected].

Note: [3] Mathematisches Institut, Universität Basel, Rheinsprung 21, CH 4051 Basel, Switzerland. Email: [email protected].

Abstract: In k-best game-tree search the k best moves of a position are computed. In practice, k = 2 and k = 3 are frequently used settings. The note describes a k-best realisation of the alpha-beta algorithm and exhibits five different visualisations of the k-best candidates during the process of iterative deepening.

DOI: 10.3233/ICG-2003-26304

Journal: ICGA Journal, vol. 26, no. 3, pp. 182-189, 2003