Publication: Desktop tower defense is NP-hard
| dc.contributor.author | Vasin Suttichaya | en_US |
| dc.contributor.other | Mahidol University | en_US |
| dc.date.accessioned | 2018-12-21T07:23:23Z | |
| dc.date.accessioned | 2019-03-14T08:03:26Z | |
| dc.date.available | 2018-12-21T07:23:23Z | |
| dc.date.available | 2019-03-14T08:03:26Z | |
| dc.date.issued | 2017-01-01 | en_US |
| dc.description.abstract | © 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. | en_US |
| dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol.10004 LNAI, (2017), 19-25 | en_US |
| dc.identifier.doi | 10.1007/978-3-319-60675-0_2 | en_US |
| dc.identifier.issn | 16113349 | en_US |
| dc.identifier.issn | 03029743 | en_US |
| dc.identifier.other | 2-s2.0-85022337090 | en_US |
| dc.identifier.uri | https://repository.li.mahidol.ac.th/handle/123456789/42391 | |
| dc.rights | Mahidol University | en_US |
| dc.rights.holder | SCOPUS | en_US |
| dc.source.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85022337090&origin=inward | en_US |
| dc.subject | Computer Science | en_US |
| dc.title | Desktop tower defense is NP-hard | en_US |
| dc.type | Conference Paper | en_US |
| dspace.entity.type | Publication | |
| mu.datasource.scopus | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85022337090&origin=inward | en_US |