Skip to main content
SpringerLink
Log in

Spatial Planning as a Hexomino Puzzle

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10191))

Included in the following conference series:

  • 1823 Accesses

Abstract

Exact cover problem is a well-known NP-complete decision problem to determine if the exact cover really exists. In this paper, we show how to solve a modified version of the famous Hexomino puzzle (being a noteworthy example of an exact cover problem) using a Dancing-links based algorithm. In this modified problem, a limited number of gaps in the rectangular box may be left uncovered (this is a common scenario in a variety of spatial planning problems). Additionally, we present the benchmark generator which allows for elaborating very demanding yet solvable problem instances. These instances were used during the qualifying round of Deadline24—an international 24-h programming marathon. Finally, we confront our baseline solutions with those submitted by the contestants, and elaborated using our two solvers.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Notes

  1. 1.

    From Japanese—a singular number.

  2. 2.

    http://www.deadline24.pl.

  3. 3.

    For the details of these tests see: http://sun.aei.polsl.pl/~jnalepa/Developer/.

References

  1. Gravier, S., Moncel, J., Payan, C.: A generalization of the pentomino exclusion problem: Dislocation of graphs. Discrete Math. 307(35), 435–444 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wachira, K., Mwangi, E., Jeon, G.: A pentomino-based path inspired demosaicking technique for the bayer color filter array. In: AFRICON 2015, pp. 1–5, September 2015

    Google Scholar 

  3. Ansótegui, C., Béjar, R., Fernández, C., Gomes, C., Mateu, C.: Generating highly balanced sudoku problems as hard problems. J. Heuristics 17(5), 589–614 (2011)

    Article  Google Scholar 

  4. Lewis, R.: Metaheuristics can solve sudoku puzzles. J. Heuristics 13(4), 387–401 (2007)

    Article  Google Scholar 

  5. Crawford, B., Castro, C., Monfroy, E.: Solving sudoku with constraint programming. In: Shi, Y., Wang, S., Peng, Y., Li, J., Zeng, Y. (eds.) MCDM 2009. CCIS, vol. 35, pp. 345–348. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02298-2_52

    Chapter  Google Scholar 

  6. Geem, Z.W.: Harmony search algorithm for solving sudoku. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007. LNCS (LNAI), vol. 4692, pp. 371–378. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74819-9_46

    Chapter  Google Scholar 

  7. Sosic, R., Gu, J.: Efficient local search with conflict minimization: a case study of the n-queens problem. IEEE Trans. Knowl. Data Eng. 6(5), 661–668 (1994)

    Article  Google Scholar 

  8. Hu, X., Eberhart, R.C., Shi, Y.: Swarm intelligence for permutation optimization: a case study of n-queens problem. In: 2003 Proceedings of the IEEE Swarm Intelligence Symposium, SIS 2003, pp. 243–246, April 2003

    Google Scholar 

  9. Mohabbati-Kalejahi, N., Akbaripour, H., Masehian, E.: Basic and hybrid imperialist competitive algorithms for solving the non-attacking and non-dominating n-queens problems. In: Madani, K., Correia, A.D., Rosa, A., Filipe, J. (eds.) Computational Intelligence. SCI, vol. 577, pp. 79–96. Springer, Cham (2015). doi:10.1007/978-3-319-11271-8_6

    Google Scholar 

  10. Lehmann, M., Mai, T.L., Wollschlaeger, B., Kabitzsch, K.: Design approach for component-based automation systems using exact cover. In: Proceedings of the IEEE Emerging Technology and Factory Automation (ETFA), pp. 1–8, September 2014

    Google Scholar 

  11. Ba, C.: An exact cover-based approach for service composition. In: 2016 IEEE International Conference on Web Services (ICWS), pp. 631–636, June 2016

    Google Scholar 

  12. Nalepa, J., Blocho, M.: Co-operation in the parallel memetic algorithm. Int. J. Parallel Prog. 43(5), 812–839 (2015)

    Article  Google Scholar 

  13. Cekała, T., Telec, Z., Trawiński, B.: Truck loading schedule optimization using genetic algorithm for yard management. In: Nguyen, N.T., Trawiński, B., Kosala, R. (eds.) ACIIDS 2015. LNCS (LNAI), vol. 9011, pp. 536–548. Springer, Cham (2015). doi:10.1007/978-3-319-15702-3_52

    Google Scholar 

  14. Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. 20(6), 2309–2327 (2016)

    Article  Google Scholar 

  15. Nalepa, J., Blocho, M.: Enhanced guided ejection search for the pickup and delivery problem with time windows. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS (LNAI), vol. 9621, pp. 388–398. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49381-6_37

    Chapter  Google Scholar 

  16. Cwiek, M., Nalepa, J., Dublanski, M.: How to generate benchmarks for rich routing problems? In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, T.-P. (eds.) ACIIDS 2016. LNCS (LNAI), vol. 9621, pp. 399–409. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49381-6_38

    Chapter  Google Scholar 

  17. Knuth, D.E.: Dancing links (2000). http://arxiv.org/abs/cs.DS/0011047

  18. Stewart, T.J., Janssen, R.: A multiobjective GIS-based land use planning algorithm. Comput. Environ. Urban Syst. 46, 25–34 (2014)

    Article  Google Scholar 

  19. Lau, B., Sprunk, C., Burgard, W.: Efficient grid-based spatial representations for robot navigation in dynamic environments. Robot. Auton. Syst. 61(10), 1116–1130 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Deadline24, Gliwice, Poland

    Marcin Cwiek & Jakub Nalepa

  2. Future Processing, Gliwice, Poland

    Marcin Cwiek & Jakub Nalepa

  3. Silesian University of Technology, Gliwice, Poland

    Jakub Nalepa

Authors
  1. Marcin Cwiek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakub Nalepa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jakub Nalepa .

Editor information

Editors and Affiliations

  1. Wrocław University of Science and Technology , Wroclaw, Poland

    Ngoc Thanh Nguyen

  2. Japan Advanced Institute of Science and Technology , Nomi, Japan

    Satoshi Tojo

  3. Japan Advanced Institute of Science and Technology , Nomi, Japan

    Le Minh Nguyen

  4. Wrocław University of Science and Technology , Wrocław, Poland

    Bogdan Trawiński

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Cwiek, M., Nalepa, J. (2017). Spatial Planning as a Hexomino Puzzle. In: Nguyen, N., Tojo, S., Nguyen, L., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2017. Lecture Notes in Computer Science(), vol 10191. Springer, Cham. https://doi.org/10.1007/978-3-319-54472-4_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-54472-4_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-54471-7

  • Online ISBN: 978-3-319-54472-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation