Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard
We prove the computational intractability of rotating and placing n square tiles into a 1 × n array such that adjacent tiles are compatible-either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as in jigsaw puzzles. Beyond basic NP-hardness, we prove that it is NP-har...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Information Processing Society of Japan (Jōhō Shori Gakkai)
2019
|
| Online Access: | https://hdl.handle.net/1721.1/122826 |