Carlotta Kvitberg: S-Kalaha: Solving a Swedish variant of Kalah
Independent project for mathematics teachers
Time:
Mon 2026-02-02 09.00 - 10.00
Location:
Meeting room 16 – Mittag-Leffler room, Albano house 1
Respondent:
Anna Hall
Supervisor:
Salvador Rodriguez Lopez (SU)
Export to calendar
Abstract: S-Kalaha is a Swedish variant of the Mancala game Kalah. Using concepts prevalent in combinatorial game theory, like game trees and strategies, this Bachelor’s thesis studies S-Kalaha as a finite combinatorial game. It also offers a presentation of S-Kalaha, listing its rules, ways of modifying its structure, and even an algorithm for playing S-Kalaha without a physical board. The thesis delves into some programming by estimating game complexity walues for S-Kalaha, and weakly solves SKalaha for specific configuration of the board. It also finds a relationship between first-player losses and the number of pits on the board.