Determining the winner in Kalah is a difficult problem
Researchers show that deciding if a player can force a win in Kalah is PSPACE-complete.
Deciding if a player can force a win in Kalah is PSPACE-complete. This applies to a version where the number of pits per side is part of the input.
The study uses a generalization where stone counts are given in unary. The hard positions feature Alice moving first with both stores initially empty.
The researchers introduced Line Kalah as an intermediate problem. This is a game played on a line where stones leave the line and effectively disappear.
They reduced quantified Boolean formulas to Line Kalah. This process uses sequential timer piles and a final capture gadget to test a clause.
The stages are placed so that premature timer firings protect earlier potential targets. Alice must choose between two captures to set a variable's truth value.
The line positions are embedded in Kalah with both stores empty. A separate Bob pit holds the score adjustment so the winner takes a strict majority.
Key facts
- Deciding if a player can force a win in Kalah is PSPACE-complete.
- The hard positions involve Alice moving first with both stores empty.
- Line Kalah is an intermediate problem where stones leave the line and disappear.