Abstract
Kotani (2002) determined the part of the state space of the Japanese Oshi-Zumo game in which pure strategies suffice to win. This paper completes the analysis by computing and discussing a Nash-optimal mixed strategy for this game.
Chapter PDF
Similar content being viewed by others
References
Billings, D., Burch, N., Davidson, A., Holte, R., Schaeffer, J., Schauenberg, T., and Szafron, D. (2003). Approximating Game-theoretic Optimal Strategies for Full-scale Poker. Proceedings of the International Joint Conference on Artificial Intelligence. To appear.
Kotani, Y. (2002). Analysis of the Pushing Sumo Game and its Application to Creativity Education. IPSJ SIG-Notes Game Informatics, Vol. 8.
Nash, J.F. (1950). Equilibrium Points in n-Person Games. National Academy of Sciences, Vol. 36, pp. 48–49.
Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P. (1992). Numerical Recipes in C. Cambridge University Press. 2nd edition.
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
Buro, M. (2004). Solving the Oshi-Zumo Game. 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_23
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive