dc.contributor.author | Adler, Aviv | |
dc.contributor.author | Bosboom, Jeffrey William | |
dc.contributor.author | Demaine, Erik D | |
dc.contributor.author | Demaine, Martin L | |
dc.contributor.author | Liu, Quanquan C. | |
dc.contributor.author | Lynch, Jayson R. | |
dc.date.accessioned | 2021-02-19T20:02:36Z | |
dc.date.available | 2021-02-19T20:02:36Z | |
dc.date.issued | 2020-03 | |
dc.identifier.isbn | 9783959771450 | |
dc.identifier.issn | 1868-8969 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/129836 | |
dc.description.abstract | In the Nikoli pencil-and-paper game Tatamibari, a puzzle consists of an m × n grid of cells, where each cell possibly contains a clue among⊞, ⊟, ◫. The goal is to partition the grid into disjoint rectangles, where every rectangle contains exactly one clue, rectangles containing are square, rectangles containing are strictly longer horizontally than vertically, rectangles containing ◫ are strictly longer vertically than horizontally, and no four rectangles share a corner. We prove this puzzle NP-complete, establishing a Nikoli gap of 16 years. Along the way, we introduce a gadget framework for proving hardness of similar puzzles involving area coverage, and show that it applies to an existing NP-hardness proof for Spiral Galaxies. We also present a mathematical puzzle font for Tatamibari. | en_US |
dc.language.iso | en | |
dc.publisher | Schloss Dagstuhl, Leibniz Center for Informatics | en_US |
dc.relation.isversionof | 10.4230/LIPIcs.FUN.2021.1 | en_US |
dc.rights | Creative Commons Attribution 3.0 unported license | en_US |
dc.rights.uri | https://creativecommons.org/licenses/by/3.0/ | en_US |
dc.source | DROPS | en_US |
dc.title | Tatamibari is NP-complete | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Adler, Aviv et al. “Tatamibari is NP-complete.” 10th International Conference on Fun with Algorithms, May-June 2021, Favignana Island, Italy, Schloss Dagstuhl and Leibniz Center for Informatics, 2021. © 2021 The Author(s) | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
dc.relation.journal | 10th International Conference on Fun with Algorithms | en_US |
dc.eprint.version | Final published version | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dc.date.updated | 2020-12-09T18:24:36Z | |
dspace.orderedauthors | Adler, A; Bosboom, J; Demaine, ED; Demaine, ML; Liu, QC; Lynch, J | en_US |
dspace.date.submission | 2020-12-09T18:24:39Z | |
mit.journal.volume | 157 | en_US |
mit.license | PUBLISHER_CC | |
mit.metadata.status | Complete | |