Abstract
An n-player, finite, probabilistic game with perfect information can be presented as a 2n-partite graph. For Can’t Stop, the graph is cyclic and the challenge is to determine the game-theoretical values of the positions in the cycles. We have presented our success on tackling one-player Can’t Stop and two-player Can’t Stop. In this article we study the computational solution of multi-player Can’t Stop (more than two players), and present a retrograde approximation algorithm to solve it by incorporating the multi-dimensional Newton’s method with retrograde analysis. Results of experiments on small versions of three- and four-player Can’t Stop are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertsekas, D.P.: Dynamic Programming and Optimal Control, 3rd edn., vol. I. Athena Scientific (2005)
Bertsekas, D.P.: Dynamic Programming and Optimal Control, 3rd edn., vol. II. Athena Scientific (2007)
Binmore, K.: Playing for Real: A Text on Game Theory. Oxford University Press, USA (2007)
Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations, USA, SIAM, Philadelphia (1996)
Fang, H.-r., Glenn, J., Kruskal, C.P.: Retrograde approximation algorithms for jeopardy stochastic games. ICGA Journal 31(2), 77–96 (2008)
Glenn, J.: An optimal strategy for Yahtzee. Technical Report CS-TR-0002, Loyola College in Maryland, 4501 N. Charles St, Baltimore MD 21210, USA (May 2006)
Glenn, J.: Computer strategies for solitaire yahtzee. In: IEEE Symposium on Computational Intelligence and Games (CIG 2007), pp. 132–139 (2007)
Glenn, J., Fang, H.-r., Kruskal, C.P.: A retrograde approximate algorithm for one-player Can’t Stop. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 148–159. Springer, Heidelberg (2007)
Glenn, J., Fang, H.-r., Kruskal, C.P.: A retrograde approximate algorithm for two-player Can’t Stop. In: Glenn, J. (ed.) CGW 2007 Workshop, Amsterdam, The Netherlands, pp. 145–156 (2007)
van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved: Now and in the future. Artificial Intelligence 134(1–2), 277–311 (2002)
Neller, T., Presser, C.: Optimal play of the dice game Pig. The UMAP Journal 25(1), 25–47 (2004)
Romein, J.W., Bal, H.E.: Solving the game of Awari using parallel retrograde analysis. IEEE Computer 36(10), 26–33 (2003)
Schaeffer, J., Björnsson, Y., Burch, N., Lake, R., Lu, P., Sutphen, S.: Building the checkers 10-piece endgame databases. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games 10. Many Games, Many Challenges, USA,, pp. 193–210. Kluwer Academic Publishers, Boston (2004)
Woodward, P.: Yahtzee: The solution. Chance 16(1), 18–22 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glenn, J., Fang, Hr., Kruskal, C.P. (2008). A Retrograde Approximation Algorithm for Multi-player Can’t Stop. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds) Computers and Games. CG 2008. Lecture Notes in Computer Science, vol 5131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87608-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-87608-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87607-6
Online ISBN: 978-3-540-87608-3
eBook Packages: Computer ScienceComputer Science (R0)