AN EFFICIENT HEURISTIC FOR EVOLVING AN AGENT IN THE STRATEGY GAME OF AYO

Article type: Research Article

Authors: Olugbara, O.O.¹ | Adigun, M.O.¹ | Ojo, S.O.² | Adewoye, T.O.³

Affiliations: Zululand, South Africa; Botswana, Botswana; Ilorin, Nigeria

Note: [1] University of Zululand, Department of Computer Science, South Africa. Email: oluolugbara@gmail.com.

Note: [2] University of Botswana, Department of Computer Science, Botswana.

Note: [3] University of Ilorin, Department of Business Administration, Nigeria.

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.

DOI: 10.3233/ICG-2007-30205

Journal: ICGA Journal, vol. 30, no. 2, pp. 92-96, 2007