Abstract
The best reported methods for turn-based multi-player game playing AI algorithms include Max\(^n\), Paranoid and Best Reply Search. All of these methods make decisions by modelling the game by assuming that there is some predetermined play ordering for the players. While this is meaningful for ordered turn-based games, there are a host of scenarios where the players need not be constrained to make their moves in such a manner. Little research has been done for turn-based games of this kind such as financial games that involve buying and selling on the stock market in no specific order (For games with shared resources (e.g., financial games) or simultaneously-played move games, one could alternatively consider multi-player AI algorithms to be those that treat the game with each opponent as a separate game. This is currently open.). In this paper, we shall present and test a new algorithm for multi-player game playing on a game which does not require a fixed sequential play ordering. The game that we have used to demonstrate this is the multi-player Snake Game, also referred to as a “Light Bike” game which is a turn-based game requiring simultaneous moves at every turn. Our newly-proposed scheme, the Multi-Minimax, along with the Added Pruning method, performs better when compared to the similar AI strategies examined in this paper. Additionally, among all the algorithms that did not use the proposed pruning, Multi-Minimax performs the best. We can conclude that, at the least, under certain conditions in the area of multi-player game playing AI, similar results can be replicated with these newly proposed Added Pruning and Multi-Minimax methods. As far as we know, the results presented here are of a pioneering sort, and we are unaware of any comparable results.
Keywords
B. J. Oommen—Chancellor’s Professor; Life Fellow: IEEE and Fellow: IAPR. This author is also an Adjunct Professor with the University of Agder in Grimstad, Norway.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Schadd, M.P.D., Winands, M.H.M.: Best reply search for multi-player games. IEEE Trans. Comput. Intell. AI Games 3(1), 57–66 (2011)
Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. intell. 6(4), 293–326 (1975)
Sturtevant, N.R., Korf, R.E.: On pruning techniques for multi-player games, vol. 49, pp. 201–207 (2000)
Sturtevant, N.: A comparison of algorithms for multi-player games. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 108–122. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40031-8_8
Luckhardt, C., Irani, K.: An algorithmic solution of N-person games. In: Proceedings of the AAAI 1986, pp. 158–162 (1986)
Sturtevant, N.: Multi-player games: algorithms and approaches. University of California (2003)
Shannon, C.E.: Programming a computer for playing chess. Philos. Mag. 41, 256–275 (1950)
Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97–109 (1985)
Campbell, M.S., Marsland, T.A.: A comparison of minimax tree search algorithms. Artif. Intell. 20(4), 347–367 (1983)
Stockman, G.C.: A minimax algorithm better than alpha-beta? Artif. Intell. 12(2), 179–196 (1979)
Buro, M.: Improving heuristic mini-max search by supervised learning. Artif. Intell. 134(1–2), 85–99 (2002)
Saffidine, A., Finnsson, H., Buro, M.: Alpha-beta pruning for games with simultaneous moves. Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)
Baier, H., Winands, M.H.M.: Monte-carlo tree search and minimax hybrids. In: 2013 IEEE Conference on Computational Inteligence in Games (CIG), pp. 1–8 (2013)
Korf, R.E.: Multi-player alpha-beta pruning. Artif. Intell. 48(1), 99–111 (1991)
Sturtevant, N.R.: Last-branch and speculative pruning algorithms for Max\(^n\). IJCAI 3, 669–678 (2003)
Sturtevant, N.R.: Leaf-value tables for pruning non-zero-sum games. International Joint Conference on Artificial Intelligence, vol. 19, p. 317 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Perez, N., Oommen, B.J. (2019). Multi-Minimax: A New AI Paradigm for Simultaneously-Played Multi-player Games. In: Liu, J., Bailey, J. (eds) AI 2019: Advances in Artificial Intelligence. AI 2019. Lecture Notes in Computer Science(), vol 11919. Springer, Cham. https://doi.org/10.1007/978-3-030-35288-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-35288-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-35287-5
Online ISBN: 978-3-030-35288-2
eBook Packages: Computer ScienceComputer Science (R0)