Abstract
The game of Ayo is a member of the Mancala family. The problem of developing heuristics for playing Mancala games by a computer agent is an open issue. This note presents a heuristic that uses a hybrid combination of minimax search and case-based reasoning, to evolve an agent that can play Ayo. The evaluation of such an evolved agent shows that this combination can result in an efficient heuristic.
Get full access to this article
View all access options for this article.