Abstract
The highly addictive stochastic puzzle game Rings has recently invaded the mobile devices. In this paper we propose the theory of a modified Rings in terms of NP-completeness and decidability. We show the NP-completeness by reduction from the 3-Partition problem, and the decidability by reduction from the Post Correspondence Problem.
Keywords
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
Iwata, S., Kasai, T.: The othello game on an n \(\times \) n board is pspace-complete. Theor. Comput. Sci. 123(2), 329–340 (1994)
Hoogeboom, H.J., Kosters, W.A.: The theory of tetris. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica 9, 14–21 (2005)
Breukelaar, R., Hoogeboom, H.J., Kosters, W.A.: Tetris is hard, made easy. In: Leiden Institute of Advanced Computer Science, Universiteit Leiden (2003)
Demaine, E.D., Hohenberger, S., Liben-Nowell, D.: Tetris is hard, even to approximate. In: Warnow, T., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 351–363. Springer, Heidelberg (2003). doi:10.1007/3-540-45071-8_36
Hoogeboom, H.J., Kosters, W.A.: Tetris and decidability. Inf. Process. Lett. 89(6), 267–272 (2004)
Abdelkader, A., Acharya, A., Dasler, P.: 2048 without new tiles is still hard. In: 8th International Conference on Fun with Algorithms, vol. 49, pp. 1–14 (2016)
Mehta, R.: 2048 is (PSPACE) hard, but sometimes easy. arXiv preprint (2014). arXiv:1408.6315
Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979)
Acknowledgements
The work was supported by National Natural Science Foundation of China (61403208), Natural Science Foundation of Jiangsu Province (BK20161516), Scientific and Technological Support Project (Society) of Jiangsu Province (BE2016776), and Science Foundation of Nanjing University of Posts and Telecommunications (NY214014).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Wu, Y., Lin, Y., Chen, X., Chen, X. (2017). The Theory of Modified Rings Game. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2017. IDEAL 2017. Lecture Notes in Computer Science(), vol 10585. Springer, Cham. https://doi.org/10.1007/978-3-319-68935-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-68935-7_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68934-0
Online ISBN: 978-3-319-68935-7
eBook Packages: Computer ScienceComputer Science (R0)