Skip to main content

On the Complexity of Jelly-no-Puzzle

  • Conference paper
  • First Online:
Discrete and Computational Geometry, Graphs, and Games (JCDCGGG 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13034))

  • 336 Accesses

Abstract

Jelly-no-Puzzle is a combinatorial puzzle with gravity and colored blocks. It can be considered as a motion planning problem in an environment in which gravity is taken into account. The computational complexity of Jelly-no-Puzzle is studied in this paper. We show that it is NP-complete for one-color, and is NP-hard in the general case.

This work was supported by the Start-up Fund of Guangdong University of Foreign Studies (No. 299-X5219228).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Jelly no Puzzle is available at http://qrostar.skr.jp/en/jelly/.

  2. 2.

    Hanano Puzzle is available at http://qrostar.skr.jp/en/hanano/.

References

  1. Friedman, E.: The game of cubic is NP-complete. In: Proceedings of Florida MAA Section Meeting (2001). http://sections.maa.org/florida/proceedings/2001/friedman.pdf

  2. Biedl, T.C., Demaine, E.D., Demaine, M.L., Fleischer, R., Jacobsen, L., Munro, J.I.: The complexity of clickomania. In: Nowakowski, R.J. (ed.), More Games of No Chance, vol. 42, pp. 389–404. MSRI Publications, Cambridge University Press (2002). http://library.msri.org/books/Book42/files/biedl.pdf

  3. Adler, A., Demaine, E.D., Hesterberg, A., Liu, Q., Rudoy, M.: Clickomania is hard, even with two colors and columns. Math. Various Entertain. Subj. 2, 325–363 (2017)

    Article  MathSciNet  Google Scholar 

  4. Gualà, L., Leucci, S., Natale, E.: Bejeweled, candy crush and other match-three games are (NP-)hard. In: 2014 IEEE Conference on Computational Intelligence and Games, pp. 1–8 (2014). https://doi.org/10.1109/CIG.2014.6932866

  5. Friedman, E.: Pushing blocks in gravity is NP-hard. http://www.stetson.edu/~efriedma/papers/gravity.pdf

  6. Liu, Z., Yang, C.: Hanano puzzle is NP-hard. Inf. Process. Lett. 145, 6–10 (2019)

    Article  MathSciNet  Google Scholar 

  7. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (ed.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)

    Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  9. Breukelaar, R., Demaine, E.D., Hohenberger, S., Hoogeboom, H.J., Kosters, W.A., Liben-Nowell, D.: Tetris is hard, even to approximate. Int. J. Comput. Geom. Appl. 14(1–2), 41–68 (2004). https://doi.org/10.1142/S0218195904001354

    Article  MathSciNet  MATH  Google Scholar 

  10. Demaine, E.D., et al.: Total tetris: tetris with monominoes, dominoes, trominoes, pentominoes... J. Inf. Process. 25, 515–527 (2017). https://doi.org/10.2197/ipsjjip.25.515

    Article  Google Scholar 

  11. Holzer, M., Schwoon, S.: Assembling molecules in ATOMIX is hard. Theoret. Comput. Sci. 313, 447–462 (2004)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The author would like to thank the anonymous referees for their very valuable comments which helped to improve this paper, especially for pointing out an error in the original statement of Lemma 1.

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yang, C. (2021). On the Complexity of Jelly-no-Puzzle. In: Akiyama, J., Marcelo, R.M., Ruiz, MJ.P., Uno, Y. (eds) Discrete and Computational Geometry, Graphs, and Games. JCDCGGG 2018. Lecture Notes in Computer Science(), vol 13034. Springer, Cham. https://doi.org/10.1007/978-3-030-90048-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-90048-9_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-90047-2

  • Online ISBN: 978-3-030-90048-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics