Skip to main content
SpringerLink
Log in

Desktop Tower Defense Is NP-Hard

  • Conference paper
  • First Online:
Book cover Trends in Artificial Intelligence: PRICAI 2016 Workshops (PRICAI 2016)

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

Included in the following conference series:

Abstract

This paper proves the hardness of the Desktop Tower Defense game. Specifically, the problem of determining where to locate k turrets in the grid of size n × n in order to maximize the minimum distance from the starting point to the terminating point is shown to be NP-hard. The proof applied to the generalized version of the Desktop Tower Defense.

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

References

  1. Aggarwal, A.: The art gallery theorem: ıts variations, applications and algorithmic aspects. Ph.D. thesis (1984)

    Google Scholar 

  2. Aloupis, G., Demaine, E.D., Guo, A., Viglietta, G.: Classic nintendo games are (computationally) hard. Theor. Comput. Sci. 586, 135–160 (2015). http://dx.doi.org/10.1016/j.tcs.2015.02.037

    Article  MathSciNet  MATH  Google Scholar 

  3. Avery, P., Togelius, J., Alistar, E., van Leeuwen, R.P.: Computational intelligence and tower defence games. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2011, New Orleans, LA, USA, 5–8 June, 2011, pp. 1084–1091. IEEE (2011). http://dx.doi.org/10.1109/CEC.2011.5949738

  4. 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. Geometry Appl. 14(1–2), 41–68 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen, S.D., Shen, H., Topor, R.W.: An efficient algorithm for constructing hamiltonian paths in meshes. Parallel Comput. 28(9), 1293–1305 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Demaine, E.D., Demaine, M.L., Hoffmann, M., O’Rourke, J.: Pushing blocks is hard. Comput. Geom. 26(1), 21–36 (2003). doi:10.1016/S0925-7721(02)00170-0

    Article  MathSciNet  MATH  Google Scholar 

  7. Demaine, E.D., Demaine, M.L., O’Rourke, J.: Pushpush and push-1 are nphard in 2d. In: Proceedings of the 12th Canadian Conference on Computational Geometry, Fredericton, New Brunswick, Canada, 16–19 August 2000 (2000). http://www.cccg.ca/proceedings/2000/26.ps.gz

  8. Forišek, M.: Computational complexity of two-dimensional platform games. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 214–227. Springer, Heidelberg (2010). doi:10.1007/978-3-642-13122-6_22

    Chapter  Google Scholar 

  9. Gens, G., Levner, E.: Complexity of approximation algorithms for combinatorial problems: a survey. SIGACT News 12(3), 52–65 (1980). http://doi.acm.org/10.1145/1008861.1008867

    Article  MATH  Google Scholar 

  10. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676–686 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  11. Johnson, R.W., Melich, M.E., Michalewicz, Z., Schmidt, M.: Coevolutionary optimization of fuzzy logic intelligence for strategic decision support. IEEE Trans. Evol. Comput. 9(6), 682–694 (2005)

    Article  Google Scholar 

  12. Kasai, T., Adachi, A., Iwata, S.: Classes of pebble games and complete problems. In: Austing, R.H., Conti, D.M., Engel, G.L. (eds.) Proceedings 1978 ACM Annual Conference, Washington, DC, USA, 4–6 December 1978, vol. II, pp. 914–918. ACM (1978). http://doi.acm.org/10.1145/800178.810161

  13. Kendall, G., Parkes, A.J., Spoerer, K.: A survey of np-complete puzzles. ICGA J. 31(1), 13–34 (2008)

    Google Scholar 

  14. Keshavarz-Kohjerdi, F., Bagheri, A.: Hamiltonian paths in some classes of grid graphs. J. Appl. Math. 2012 (2012)

    Google Scholar 

  15. Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inform. Theory 32(2), 276–282 (1986). http://dx.doi.org/10.1109/TIT.1986.1057165

    Article  MathSciNet  MATH  Google Scholar 

  16. O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press Inc., New York (1987)

    MATH  Google Scholar 

  17. Robson, J.M.: The complexity of go. In: IFIP Congress. pp. 413–417 (1983)

    Google Scholar 

  18. Robson, J.M.: N by N checkers is exptime complete. SIAM J. Comput. 13(2), 252–267 (1984). http://dx.doi.org/10.1137/0213018

    Article  MathSciNet  MATH  Google Scholar 

  19. Shannon, C.E.: Programming a Computer for Playing Chess. In: Levy, D. (ed.) Computer chess compendium, pp. 2–13. Springer, New York (1988)

    Chapter  Google Scholar 

  20. Sutoyo, R., Winata, D., Oliviani, K., Supriyadi, D.M.: Dynamic difficulty adjustment in tower defence. In: Procedia Computer Science, pp. 435–444 (2015)

    Google Scholar 

  21. Umans, C., Lenhart, W.: Hamiltonian cycles in solid grid graphs. In: FOCS, pp. 496–505. IEEE Computer Society (1997)

    Google Scholar 

  22. Viglietta, G.: Gaming is a hard job, but someone has to do it! Theory Comput. Syst. 54(4), 595–621 (2014). http://dx.doi.org/10.1007/s00224-013-9497-5

    Article  MathSciNet  MATH  Google Scholar 

  23. Zamfirescu, C., Zamfirescu, T.: Hamiltonian properties of grid graphs. SIAM J. Discrete Math. 5(4), 564–570 (1992)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Faculty of Engineering, Mahidol University, Salaya, Thailand

    Vasin Suttichaya

Authors
  1. Vasin Suttichaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vasin Suttichaya .

Editor information

Editors and Affiliations

  1. ISIR, Osaka University, Ibaraki, Osaka, Japan

    Masayuki Numao

  2. Thammasat University, Bangkadi Muang Pathumthani, Thailand

    Thanaruk Theeramunkong

  3. National Electronics and Computer Technology Center, Language and Semantic Technology Lab, Pathum Thani, Thailand

    Thepchai Supnithi

  4. Information Technology, King Mongkut's University of Technology North Bangkok, Bangkok, Thailand

    Mahasak Ketcham

  5. Mahidol University, Bangkok, Thailand

    Narit Hnoohom

  6. Media Technology, King Mongkut's University of Technology Thonburi, Thonburi, Thailand

    Patiyuth Pramkeaw

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Suttichaya, V. (2017). Desktop Tower Defense Is NP-Hard. In: Numao, M., Theeramunkong, T., Supnithi, T., Ketcham, M., Hnoohom, N., Pramkeaw, P. (eds) Trends in Artificial Intelligence: PRICAI 2016 Workshops. PRICAI 2016. Lecture Notes in Computer Science(), vol 10004. Springer, Cham. https://doi.org/10.1007/978-3-319-60675-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60675-0_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60674-3

  • Online ISBN: 978-3-319-60675-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation