Solving Kalah

G. Irving*, H.H.L.M. Donkers, J.W.H.M. Uiterwijk

*Corresponding author for this work

Research output: Contribution to journalArticleAcademicpeer-review


Using full-game databases and optimized tree-search algorithms, the game of Kalah is solved for several starting configurations up to 6 holes and 5 counters per hole. The main search algorithm used was iterative-deepening MTD(f). Major search enhancements were move ordering, transposition tables, futility pruning, enhanced transposition cut-off, and endgame databases.
Original languageEnglish
Pages (from-to)139-147
JournalICGA Journal
Publication statusPublished - 1 Jan 2000


Dive into the research topics of 'Solving Kalah'. Together they form a unique fingerprint.

Cite this