Skip to main content
SpringerLink
Log in

A Case Study on the Graph-Transformational Modeling and Analysis of Puzzles

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2021)

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

Included in the following conference series:

  • 337 Accesses

Abstract

In this paper, we start a case study on the use and usefulness of graph transformation in modeling and analyzing games and puzzles beginning with logic puzzles. More explicitly, we consider Sudoku, Hashiwokakero, Arukone, and Maze aka Labyrinth. In these cases, the underlying data structures can be represented by graphs and the puzzles have start configurations and goals besides the solving rules. Sometimes it is meaningful to regulate the rule application by some control conditions. These are the ingredients of graph transformation units which are therefore applied as modeling framework. Based on the graph-transformational models, one can show that Labyrinth can be solved in polynomial time and solvability of the other three is NP-complete.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Heckel, R.: Graph transformation in a nutshell. Electron. Notes Theor. Comput. Sci. 148(1), 187–198 (2006)

    Article  Google Scholar 

  2. Hölscher, K., Kreowski, H.-J., Kuske, S.: Autonomous units to model interacting sequential and parallel processes. Fundamenta Informaticae 92, 233–257 (2009)

    Article  MathSciNet  Google Scholar 

  3. Kreowski, H.-J., Kuske, S., Tönnies, H.: Autonomous units to model games. In: Fischer, S., Maehle, E., Reischuk, R. (eds.) Informatik 2009, Im Focus das Leben, volume 154 of Lecture Notes in Informatics, pp. 3465–3472 (2009)

    Google Scholar 

  4. Priemer, D., George, T., Hahn, M., Raesch, L., Zündorf, A.: Using graph transformation for puzzle game level generation and validation. In: Echahed, R., Minas, M. (eds.) ICGT 2016. LNCS, vol. 9761, pp. 223–235. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-40530-8_14

    Chapter  Google Scholar 

  5. Rensink, A., et al.: Ludo: a case study for graph transformation tools. In: Schürr, A., Nagl, M., Zündorf, A. (eds.) AGTIVE 2007. LNCS, vol. 5088, pp. 493–513. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89020-1_34

    Chapter  Google Scholar 

  6. Zambon, E., Rensink, A.: Solving the N-Queens problem with GROOVE - towards a compendium of best practices. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 67, 13 p. (2014)

    Google Scholar 

  7. Kreowski, H.-J., Kuske, S.: On the interleaving semantics of transformation units—a step into GRACE. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 89–106. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61228-9_81

    Chapter  Google Scholar 

  8. Kreowski, H.-J., Kuske, S., Rozenberg, G.: Graph transformation units – an overview. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 57–75. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68679-8_5

    Chapter  Google Scholar 

  9. Ehrig, H., Pfender, M., Schneider, H.-J.: Graph grammars: an algebraic approach. In: IEEE Conference on Automata and Switching Theory, Iowa City, pp. 167–180 (1973)

    Google Scholar 

  10. Corradini, A., Ehrig, H., Heckel, R., Löwe, M., Montanari, U., Rossi, F.: Algebraic approaches to graph transformation part I: basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1: Foundations, pp. 163–245. World Scientific, Singapore (1997)

    Google Scholar 

  11. Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 86, 1052–1060 (2003)

    Google Scholar 

  12. Andersson, D.: Hashiwokakero is NP-complete. Inf. Process. Lett. 109(19), 1145–1146 (2009)

    Article  MathSciNet  Google Scholar 

  13. Kotsuma, K., Takenaga, Y.: NP-completeness and enumeration of Number Link puzzle. IEICE Tech. Rep. 109(465), 1–7 (2010)

    Google Scholar 

  14. Adcock, A., et al.: Zig-zag numberlink is NP-complete. J. Inf. Process. 23(3), 239–245 (2015)

    Google Scholar 

  15. Kreowski, H.-J., Kuske, S.: Modeling and analyzing graph algorithms by means of graph transformation units. J. Object Technol. 19(3), 3:1–14 (2020). https://doi.org/10.5381/jot.2020.19.3.a9

  16. Kendall, G., Parkes, A.J., Spoerer, K.: A survey of NP-complete puzzles. J. Int. Comput. Games Assoc. 31(1), 13–34 (2008)

    Google Scholar 

Download references

Acknowledgment

We are very grateful to the anonymous reviewers for their helpful comments that led to various improvements.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski & Aaron Lye

Authors
  1. Hans-Jörg Kreowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aaron Lye
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aaron Lye .

Editor information

Editors and Affiliations

  1. Università di Pisa, Pisa, Italy

    Fabio Gadducci

  2. Humboldt-Universität zu Berlin, Berlin, Germany

    Timo Kehrer

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

Kreowski, HJ., Lye, A. (2021). A Case Study on the Graph-Transformational Modeling and Analysis of Puzzles. In: Gadducci, F., Kehrer, T. (eds) Graph Transformation. ICGT 2021. Lecture Notes in Computer Science(), vol 12741. Springer, Cham. https://doi.org/10.1007/978-3-030-78946-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-78946-6_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-78945-9

  • Online ISBN: 978-3-030-78946-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation