Solving kalah

Abstract

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.

Publication
ICGA Journal
Date