Abstract
We propose a novel strategy of decision-making based on the idea of the position in which different players find themselves in a board game to focus not only on own piece but also on all pieces on the same position. This strategy will be independent of any particular search algorithm, thereby providing good quality movement for a general-purpose player. In an attempt to provide more insight into the nature of modeling artificial players three algorithms and five strategies in total have been implemented in the Great Turtle Race game. Based on statistical analysis the highest winning rate is found using this positioning strategy combined with alpha-beta pruning. In particular, this paper presents the joint model of these algorithms and strategies together with a concise summary of the game rules, suggesting possible correlations. These theoretical findings are complemented by experiments that were conducted to evaluate the winning rates.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bakkes, S.C., Spronck, P.H., van den Herik, H.J.: Opponent modelling for case-based adaptive game AI. Entertain. Comput. 1(1), 27–37 (2009). https://doi.org/10.1016/j.entcom.2009.09.001
Bosansky, B., Lisy, V., Lanctot, M., Cermak, J., Winands, M.H.: Algorithms for computing strategies in two-player simultaneous move games. Artif. Intell. 237, 1–40 (2016). https://doi.org/10.1016/j.artint.2016.03.005
Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1–43 (2012). https://doi.org/10.1109/TCIAIG.2012.2186810
Cowling, P.I., Ward, C.D., Powley, E.J.: Ensemble determinization in Monte Carlo tree search for the imperfect information card game magic: the gathering. IEEE Trans. Comput. Intell. AI Games 4(4), 241–257 (2012). https://doi.org/10.1109/TCIAIG.2012.2204883
Dobre, M.S., Lascarides, A.: Online learning and mining human play in complex games. In: 2015 IEEE Conference on Computational Intelligence and Games, CIG, pp. 60–67, August 2015. https://doi.org/10.1109/CIG.2015.7317942
Garcia-Sanchez, P., Tonda, A., Mora, A.M., Squillero, G., Merelo, J.J.: Automated playtesting in collectible card games using evolutionary algorithms: a case study in hearthstone. Knowl.-Based Syst. 153, 133–146 (2018). https://doi.org/10.1016/j.knosys.2018.04.030
den Heede, D.V.: Teaching computers to play chess through deep reinforcement learning. Master’s thesis. Ghent University (2017)
Moreira, J.A.G.: Evolutionary dynamics of cooperation in multiplayer games. Ph.D. thesis. University of Lisbon (2011)
Przybylski, M., Król, D.: Mastering strategies in a board game of imperfect information for different search techniques. In: 2017 IEEE International Conference on INnovations in Intelligent SysTems and Applications, INISTA, pp. 195–200, July 2017. https://doi.org/10.1109/INISTA.2017.8001156
Weber, M., Tirronen, V., Neri, F.: Fitness diversity parallel evolution algorithms in the turtle race game. In: Giacobini, M., et al. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 303–312. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01129-0_34
Whitehouse, D.: Monte Carlo tree search for games with hidden information and uncertainty. Ph.D. thesis. University of York (2014)
Acknowledgments
This research received financial support from the statutory funds at the Wrocław University of Science and Technology.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Przybylski, M., Król, D. (2018). Modeling Competitive Game Players with a Positioning Strategy in the Great Turtle Race. In: Nguyen, N., Pimenidis, E., Khan, Z., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2018. Lecture Notes in Computer Science(), vol 11056. Springer, Cham. https://doi.org/10.1007/978-3-319-98446-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-98446-9_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98445-2
Online ISBN: 978-3-319-98446-9
eBook Packages: Computer ScienceComputer Science (R0)