Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 100 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 29 tok/s Pro
GPT-4o 103 tok/s
GPT OSS 120B 480 tok/s Pro
Kimi K2 215 tok/s Pro
2000 character limit reached

Towards a Model of Puzznic (2310.01503v1)

Published 2 Oct 2023 in cs.AI

Abstract: We report on progress in modelling and solving Puzznic, a video game requiring the player to plan sequences of moves to clear a grid by matching blocks. We focus here on levels with no moving blocks. We compare a planning approach and three constraint programming approaches on a small set of benchmark instances. The planning approach is at present superior to the constraint programming approaches, but we outline proposals for improving the constraint models.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)
  1. Conjure: Automatic generation of constraint models from problem specifications. Artificial Intelligence, 310:103751, 2022. doi:10.1016/j.artint.2022.103751.
  2. Constraint satisfaction techniques in planning and scheduling. Journal of Intelligent Manufacturing, 21(1):5–15, 2010.
  3. Reformulating constraint models for classical planning. In Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15-17, 2008, pages 525–530. AAAI Press, 2008.
  4. CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In Proceedings of SAT Competition 2020 – Solver and Benchmark Descriptions, pages 50–53, 2020. URL: http://hdl.handle.net/10138/318754.
  5. Michael C. Chavrimootoo. Defying gravity: The complexity of the Hanano puzzle. arXiv, 2022. doi:10.48550/arXiv.2205.03400.
  6. Dominance breaking constraints. Constraints, 20(2):155–182, 2015. doi:10.1007/s10601-014-9173-7.
  7. Plotting: a planning problem with complex transitions. In 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), pages 22:1–22:17, 2022. doi:10.4230/LIPIcs.CP.2022.22.
  8. Erich Friedman. The game of cubic is NP-complete. 34th Annual Florida MAA Section Meeting, 2001.
  9. Search in the patience game ‘black hole’. AI Communications, 20(3):211–226, 2007. https://content.iospress.com/articles/ai-communications/aic405.
  10. Automated Planning: theory and practice. Elsevier, 2004.
  11. An Introduction to the Planning Domain Definition Language. Synthesis Lectures on Artificial Intelligence and Machine Learning. Springer, 2019. doi:10.2200/S00900ED2V01Y201902AIM042.
  12. Malte Helmert. The Fast Downward planning system. Journal of Artificial Intelligence Research, 26:191–246, 2006. doi:10.1613/jair.1705.
  13. Modelling and solving English Peg Solitaire. Comput. Oper. Res., 33(10):2935–2959, 2006. doi:10.1016/j.cor.2005.01.018.
  14. Hanano puzzle is NP-hard. Information Processing Letters, 145:6–10, 2019. doi:10.1016/j.ipl.2019.01.003.
  15. Peter Nightingale. Savile Row manual, 2021. doi:10.48550/arXiv.2201.03472.
  16. Automatically improving constraint models in Savile Row. Artificial Intelligence, 251:35–61, 2017. doi:10.1016/j.artint.2017.07.001.
Citations (1)
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.