Abstract
Lines of Action (LOA) is a two-person zero-sum chess-like connection game. Building an evaluation function for LOA is a difficult task because not much knowledge about the game is available. In this paper the evaluation function of the tournament program MIA is explained. This evaluator consists of the following nine features: concentration, centralisation, centre-of-mass position, quads, mobility, walls, connectedness, uniformity, and player to move. These features have resulted in the evaluator MIA IV. The evaluator is tested in a tournament against other LOA evaluators, which have performed well at the previous Computer Olympiads. Experiments show that MIA IV defeats them with large margins. It turns out that the evaluator even performs better at deeper searches.
Chapter PDF
References
Aid, S. G. and Newborn, M. M. (1977). The principal continuation and the killer heuristic. In 1977 ACM Annual Conference Proceedings, pages 466–473. ACM, Seattle.
Allis, L. V. (1994). Searching for Solutions in Games and Artificial Intelligence. Ph.D. Thesis, University of Limburg, Maastricht, The Netherlands.
Billings, D. and Björnsson, Y. (2002). Mona and YL’s Lines of Action Page. http://www.cs.ualberta.cab-adarse/LOA.
Björnsson, Y. (2000). Y1 wins Lines of Action tournament. ICGA Journal, 23 (3): 179–180.
Björnsson, Y. and Marsland, T. A. (1999). Multi-cut alpha-beta pruning. In Van den Herik, H. J. and lida, H., editors, Computers and Games, Lecture Notes in Computing Science 1558, pages 15–24. Springer Verlag, Heidelberg, Germany.
Björnsson, Y. and Winands, M. (2001). YI wins Lines of Action tournament. ICGA Journal, 24 (3): 180–181.
Björnsson, Y. and Winands, M. (2002). Yl wins Lines of Action tournament. ICGA Journal, 25 (3): 185–186.
Breuker, D. M., Uiterwijk, J. W. H. M., and van den Herik, H. J. (1996). Replacement schemes and two-level tables. ICCA Journal, 19 (3): 175–180.
Chaunier, C. and Handscomb, K. (2001). Lines of action strategic ideas–part 4. Abstract Games, 2 (1): 12–14.
Donninger, C. (1993). Null move and deep search: Selective-search heuristics for obtuse chess programs. ICCA Journal, 16 (3): 137–143.
Dyer, D. (2000). Lines of Action Homepage. http://www.andromeda.com/people/ddyer/logloa.html.
Gray, S. B. (1971). Local properties of binary images in two dimensions. IEEE Transactions on Computers, 20 (5): 551–561.
Handscomb, K. (2000). Lines of action strategic ideas–part 1. Abstract Games, 1 (1): 9–11.
Hashimoto, T., Nagashima, J., Sakuta, M., Uiterwijk, J. W. H. M., and Iida, H. (2003). Automatic realization-probability search. Internal report, Dept. of Computer Science, University of Shizuoka, Hamamatsu, Japan.
Heinz, E. A. (1999). Adaptive null-move pruning. ICCA Journal, 22 (3): 123–132.
Knuth, D. E. and Moore, R. W. (1975). An analysis of alpha-beta pruning. Artificial Intelligence, 6 (4): 293–326.
Marsland, T. A. and Campbell, M. (1982). Parallel search on strongly ordered game trees. Computing Surveys, 14 (4): 533–551.
Sackson, S. (1969). A Gamut of Games. Random House, New York, NY, USA.
Schaeffer, J. (1983). The history heuristic. ICCA Journal, 6 (3): 16–19.
Schaeffer, J. and Plaat, A. (1996). New advances in alpha-beta searching. In Proceedings of the 1996 ACM 24th annual conference on Computer science, pages 124–130. ACM Press, New York, NY, USA.
Uiterwijk, J. W. H. M. and van den Herik, H. J. (2000). The advantage of the initiative. Information Sciences, 122 (1): 43–58.
Winands, M. H. M. (2000). Analysis and Implementation of Lines of Action. M.Sc. Thesis, Universiteit Maastricht, Maastricht, The Netherlands.
Winands, M. H. M., Kocsis, L., Uiterwijk, J. W. H. M., and van den Herik, H. J. (2002). Temporal difference learning and the Neural MoveMap heuristic in the game of Lines of Action. In Mehdi, Q., Gough, N., and Cavazza, M., editors, GAME-ON 2002 3rd International Conference on Intelligent Games and Simulation,pages 99–103. SCS Europe Bvba.
Winands, M. H. M., Uiterwijk, J. W. H. M., and van den Herik, H. J. (2001). The quad heuristic in Lines of Action. ICGA Journal, 24 (1): 3–15.
Winands, M. H. M., van den Herik, H. J., Uiterwijk, J. W. H. M., and van der Werf, E. C. D. (2003). Enhanced forward pruning. Accepted for publication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Winands, M.H.M., van den Herik, H.J., Uiterwijk, J.W.H.M. (2004). An Evaluation Function for Lines of Action. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds) Advances in Computer Games. IFIP — The International Federation for Information Processing, vol 135. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35706-5_16
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive