Changes

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 <ref>[[Alex Bell]] ('''1968'''). ''[http://www.chilton-computing.org.uk/acl/literature/reports/p003.htm Kalah on Atlas]''. [http://www.chilton-computing.org.uk/acl/literature/reports/overview.htm Literature: Reports] hosted by [[Atlas Computer Laboratory]]</ref>. In 1968, [[James R. Slagle]] and [[Philip Bursky]] used Kalah in [[James R. Slagle#TheoremProving|Theorem-Proving]] <ref>[[James R. Slagle]] and , [[Philip Bursky]] ('''1968'''). ''[http://portal.acm.org/citation.cfm?id=321444 Experiments With a Multipurpose, Theorem-Proving Heuristic Program]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 1</ref>, and in 1970, Slagle and [[John K. Dixon|Dixon]] illustrated their [[James R. Slagle#MNprocedure|M & N search algorithm]] with Kalah as well <ref>[[James R. Slagle]] and , [[John K. Dixon]] ('''1970'''). ''[http://portal.acm.org/citation.cfm?id=362052.362054 Experiments with the M & N Tree-Searching Program]''. [[ACM#Communications|Communications of the ACM]], Vol. 13, No. 3, pp. 147-154</ref>.