Mancala Strategy: Count the Landing Before You Sow
Build a Mancala strategy around counting your final seed: compare extra turns, captures and the end sweep in ProjectGAMR's four-seed Kalah variant.

Use the rules of this particular board
A practical Mancala strategy starts by predicting where the final seed lands. This guide uses ProjectGAMR's Kalah variant: six small pits per side, four seeds in each at the start, and two empty stores. Lime moves first. Choose a nonempty pit on your own side and sow its entire contents counterclockwise.
Put one seed in each following pit and your own store, skipping the opposing store. A final seed in your store gives another move unless the game has ended. The linked developer and university instructions provide Kalah context; their starting counts need not match this four-seed board.
Count the distance to your store
On Lime's lower row, count the small pits from left to right. From the third pit, four drops reach the store: the fourth pit, fifth pit, sixth pit, then store. At the initial position that pit contains four seeds, so choosing it places one in the store and keeps Lime's turn.
The third pit becomes empty and the three pits after it each hold five. Your other two pits still contain four. This is a worked count, not a claim that one opening guarantees victory. Predict all changed pits as well as the store before comparing another move.
Recount after the first move changes the piles
After that opening, the pit next to Lime's store holds five seeds. Choosing it now deposits one in the store and four on the opposing row. The final seed lands on the opponent's side, so the move passes to Violet. Being next to the store did not make it an extra turn.
Longer piles may pass around the board. Count only actual deposits: passing the opposing store uses no seed. If sowing returns to the emptied starting pit, this version deposits there too. Continue tracing the route instead of reusing a distance calculation that covered only the first approach to your store.
Check what sits opposite a potential capture
For a composed example, imagine one seed in a pit followed by an empty pit on your side. The opposite pit across from that destination contains five seeds, and other pits keep the game active. Sowing the single seed into the empty destination captures that seed and the five opposite: six go into your store.
Both the destination and its opposite become empty. Here, a capture requires opposite seeds; an empty opposite pit yields no capture. Also, capturing does not itself grant another turn. Before selecting a move, identify the exact destination and opposite pair rather than assuming every empty pit is an opportunity.
Treat the extra move as another decision
An extra turn lets you choose again from a changed board. Recalculate the available piles and possible captures after each sow. Do not commit to a sequence just because its first move ends in your store.
For a short comparison, note three things about each candidate: final landing place, immediate change to your store, and pits left for the next decision. Those observations describe what the move does. They do not evaluate every reply, prove an optimal continuation or turn the largest immediate collection into a guaranteed best move.
Include the remaining seeds before calling the result
When either side has no seeds in its small pits, the game ends and remaining seeds on the other side enter that player's store. Imagine your final sow leaves your store at 22, the opponent's at 21, your row empty and five seeds on their row. The final result is 22–26, despite your apparent lead before collection.
Check that final collection before choosing a move that empties your side. The browser handles sowing, captures and scoring automatically; these examples explain the decisions behind those changes. New game restores the starting board. Counting one complete move accurately is a useful practice task without assuming it solves every later choice.
Keep exploring
Sources & further reading
- WorldTree Software: developer's Kalah sowing, capture and ending rules ↗
- Rose-Hulman archive: Matthias Neumeister's Kalah rules, May 11, 1999 ↗
Have a correction? Tell our editorial team.
