Kalah

From Chessprogramming wiki
Revision as of 20:09, 8 January 2019 by GerdIsenberg (talk | contribs)
Jump to: navigation, search

Home * Games * Kalah

Wooden Kalah-Board [1]

Kalah,
a two-player abstract strategy game in the Mancala family invented in 1940 by William Julius Champion, Jr., commercialized since 1944 and patented in 1952 (Design) and 1955 (Rules). The Kalah brand name was protected in the US from 1970 until 2002, but was copycat under various names and variants such as Conference (Mieg's, 1965), Sahara (Pelikan, 1976) [2] and Bantumi (Nokia Mobiles since 2000) [3].


Kalah in AI

Kalah has a long history in Artificial Intelligence research. First Kalah programs were already written in the 60s, Alex Bell popularized Kalah programming in 1968 [4]. In 1968, James R. Slagle and Philip Bursky used Kalah in Theorem-Proving [5], and in 1970, Slagle and Dixon illustrated their M & N search algorithm with Kalah as well [6].

Jugend forscht

Paul Erich Frielinghaus, a German actor, developed a Kalah program (he called the game Serata) as High School student in 1978 and participated in the German youth science competition Jugend forscht [7].

Solving Kalah

The notation (m,n)-Kalah refers to Kalah with m pits per side and n stones in each pit. In 2000, Kalah was solved by Geoffrey Irving, Jeroen Donkers, and Jos Uiterwijk for all m ≤ 6 and n ≤ 6, except (6,6) [8] [9]. (6,6)-Kalah was solved in 2011 by Anders Carstensen and Kim Skak Larsen [10].

See also

Selected Publications

External Links

References

Up one Level