Solving Kalah

G. Irving; H.H.L.M. Donkers; J.W.H.M. Uiterwijk

doi:10.3233/ICG-2000-23303

Solving Kalah

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

^*Corresponding author for this work

Research output: Contribution to journal › Article › Academic › peer-review

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	https://doi.org/10.3233/ICG-2000-23303
Publication status	Published - 1 Jan 2000

Access to Document

10.3233/ICG-2000-23303

Cite this

@article{361237aff46a4ae3ba0d9aeae60213e2,

title = "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.",

author = "G. Irving and H.H.L.M. Donkers and J.W.H.M. Uiterwijk",

year = "2000",

month = jan,

day = "1",

doi = "10.3233/ICG-2000-23303",

language = "English",

volume = "23",

pages = "139--147",

journal = "ICGA Journal",

issn = "1389-6911",

publisher = "IOS Press",

}

TY - JOUR

T1 - Solving Kalah

AU - Irving, G.

AU - Donkers, H.H.L.M.

AU - Uiterwijk, J.W.H.M.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

U2 - 10.3233/ICG-2000-23303

DO - 10.3233/ICG-2000-23303

M3 - Article

SN - 1389-6911

VL - 23

SP - 139

EP - 147

JO - ICGA Journal

JF - ICGA Journal

ER -

Solving Kalah

Abstract

Access to Document

Fingerprint

Cite this