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.
Original language | English |
---|---|
Pages (from-to) | 139-147 |
Journal | ICGA Journal |
Volume | 23 |
DOIs | |
Publication status | Published - 1 Jan 2000 |