Name
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 algo- rithm used was iterative-deepening MTD(f). Major search enhancements were move ordering, transposition tables, futility pruning, enhanced transposition cut-off, and endgame databases. |
Year | Venue | DocType |
|---|---|---|
2000 | ICGA Journal | Journal |
Volume | Issue | Citations |
23 | 3 | 2 |
PageRank | References | Authors |
0.65 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Geoffrey Irving | 1 | 2 | 0.65 |
| Jeroen Donkers | 2 | 8 | 4.23 |
| Jos Uiterwijk | 3 | 2 | 1.66 |