A simple proof that the (n2 − 1)-puzzle is hard
© 2018 Elsevier B.V. The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled unit squares within a 4×4 board in which the goal is to slide the squares (without ever overlapping) into a target configuration. By generalizing the puzzle to an n×n board with n2−1 squares, we can...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier BV
2021
|
| Online Access: | https://hdl.handle.net/1721.1/134978 |