Randle Oluwarotimi Abayomi
ABSTRACT
The game of Awale 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 study presents a heuristics that uses a hybrid combination of Minimax search and Aggregate Malanobis Distance Function (AMDF), to evolve a player that can play Awale. The evaluation of such an evolved player shows that this combination can result in an efficient heuristic.
- Donkers, H. H. L. M., Uiterwijk, J. W. H. M. and Voogt, A. J. D. V., Mancala Games- Topics in Artificial Intelligence and Mathematics. Step by Step Proceedings of the 4th Colloquium Board Games in Academia, 2002Google Scholar
- Nash, J., Two-Person Cooperative Games. Econometrics 21, pp. 128--140, 1953Google ScholarCross Ref
- Washburn, A., A New Kind of Fictitious Play, http://www.nps.Navy.mil/papers/ Washbornpa/fictitious.pdf, 2001Google Scholar
- Dantzig, G. A proof of the equivalence of the programming problem and game problem, Activity analysis of production and allocation, Koopmans (ed.) Wiley, New York, pp. 339--347, 1951Google Scholar
- Ayeni, J. O. A and Longe, H. O. D., Game People Play: Ayo. International Journal of Game Theory, Vol. 14 issue 4, pp. 207--218, 1985Google ScholarCross Ref
- Knuth, D. E. and Moore, R. W., An Analysis of Alpha-beta Pruning, Artificial Intelligence 6, 4, 293--326, 1975Google ScholarCross Ref
- Thompson, K., Computer Chess Strength, in Advances in Computer Chess 3, M. Clarke (ed.), Pergamon Press, Oxford, pp. 55--56, 1982Google Scholar
- Thomson, K., 6-piece Endgames, ICCA Journal, vol. 19, no. 4, pp. 215--226, 1996Google Scholar
- Hamilton, S. and Garber, L., Deep Blue's hardware-software synergy, IEEE Computer, 30, 10, pp. 29--35, 1997 Google ScholarDigital Library
- Myriad software, http://www.myriad-online.com/awale.htmGoogle Scholar
- Lincke, T. R and Marzetta, A., Large endgame databases with Limited Memory Space. ICGA Journal, 23, 3, pp. 131--138, 2000Google Scholar
- Allis, V., Muellen, M. V. D. and Herik, J. V. D, Proof-number Search, Artificial Intelligence, vol. 66, pp. 91--124, 1994 Google ScholarDigital Library
- Lincke, T. R., Strategies for the Automatic Construction of Opening Books: Computers and Games, pp. 74--86, 2000 Google ScholarDigital Library
- The University of Alberta Computer Awari Group, http://www.cs.ualberta.ca/~awari/Google Scholar
- Bal, H. E. and Allis, L. V., Parallel Retrograde Analysis on a Distributed System. Supercomputing, 1995 Google ScholarDigital Library
- Thomson, K., Retrograde Analysis of Certain Endgames, ICCA Journal, vol. 9, no. 3, pp. 131--139, 1986Google Scholar
- Rijswijck, J. V. D., Learning from Perfection: A Data Mining Approach to Evaluation Function in Awari. In proceedings of the 2nd International Conference (CG-00), vol. 2063, pp. 115--132, 2001 Google ScholarDigital Library
- Davis, J. E. and Kendall, G., An Investigation, using co-evolution, to evolve an Awari Player. In proceedings of Congress on Evolutionary Computation (CEC 2002), pp. 1408--1413, 2002 Google ScholarDigital Library
- Daoud, M., Kharma, N., Haidar, A. and Popoola, J., Ayo, the Awari Player, or How Better Representation Trumps Deeper Search, Proceedings of the 2004 IEEE Congress on Evolutionary Computation, pp. 1001--1006, 2004Google ScholarCross Ref
- Bruin, A. D., Pijls, W. and Plaat, A. Solution Trees as a Basic for Game Tree Search, ICCA Journal, 17, 4, pp. 207--219, 1994Google Scholar
- Bruin, A. D. and Pijls, W., Trends in Game Tree Search. SOFSEM, pp. 255--274, 1996 Google ScholarDigital Library
- Samuel, A. L., Some Studies in Machine Learning Using the Game of Checkers, IBM J. of Res. And Dev. 3, 210--229, 1959 Google ScholarDigital Library
- Pijls, W. and Bruin, A. D., Game Tree Algorithms and Solution Trees, theor. Compt. Sci., 252 (1--20: pp. 197--215, 2001 Google ScholarDigital Library
- Mahalanobis, P. C., On the generalized distance in statistics. Proceedings of the national Institute of Science of India, pp. 49--55, 1936Google Scholar
- Maesschalck, De. R., Jouan-Rimbaud, D., massart, D. L., The Malanobis distance. Chemometrics and Intelligent Laboratory Systems, pp. 1--18, 2000Google Scholar
- Iyegun, C. and Ben-Isreal, A., Probabilistic Distance Clustering Adjusted for Cluster Size. Probability in the Engineering and Informational Sciences, 22, 603--621, 2008 Google ScholarDigital Library
- An efficient hybrid algorithm to evolve an Awale player
Recommendations
A program for Progressive chess
In Progressive chess, rather than just making one move per turn, players play progressively longer series of moves. Combinatorial complexity generated by many sequential moves represents a difficult challenge for classic search algorithms. In this ...
Error analysis in minimax trees
Algorithmic combinatorial game theoryGame tree search deals with the problems that arise, when computers play two-person-zero-sum-games such as chess, checkers, othello, etc. The greatest success of game tree search so far, was the victory of the chess machine 'Deep Blue' vs. G. Kasparov (...
Nimbers are inevitable
This article concerns the resolution of impartial combinatorial games, in particular games that can be split in sums of independent positions. We prove that in order to compute the outcome of a sum of independent positions, it is always more efficient ...
Comments