Picture-hanging puzzles
We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic...
Main Authors: | Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Minsky, Yair N. (Author), Mitchell, Joseph S. B. (Author), Rivest, Ronald L. (Contributor), Patrascu, Mihai (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2012-08-28T20:47:41Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Picture-Hanging Puzzles
by: Demaine, Erik D, et al.
Published: (2020) -
Bust-a-Move/Puzzle Bobble Is NP-complete
by: Langerman, Stefan, et al.
Published: (2017) -
Symmetric assembly puzzles are hard, beyond a few pieces
by: Demaine, Erik D, et al.
Published: (2020) -
Push-Pull Block Puzzles are Hard
by: Demaine, Erik D, et al.
Published: (2019) -
Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard
by: Bosboom, Jeffrey William, et al.
Published: (2019)