Vasin SuttichayaMahidol University2018-12-212019-03-142018-12-212019-03-142017-01-01Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10004 LNAI, (2017), 19-2516113349030297432-s2.0-85022337090https://repository.li.mahidol.ac.th/handle/20.500.14594/42391© Springer International Publishing AG 2017. 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.Mahidol UniversityComputer ScienceConference PaperSCOPUS10.1007/978-3-319-60675-0_2