Next Article in Journal / Special Issue
An Integer Programming Approach to Solving Tantrix on Fixed Boards
Previous Article in Journal
A Semi-Preemptive Computational Service System with Limited Resources and Dynamic Resource Ranking
Previous Article in Special Issue
How to Solve the Torus Puzzle
Article

Any Monotone Function Is Realized by Interlocked Polygons

1
Computer Science and Artificial Intelligence Lab, Massachusetts Institute of Technology, MA 02139,USA
2
School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa 923-1292, Japan
*
Author to whom correspondence should be addressed.
Algorithms 2012, 5(1), 148-157; https://doi.org/10.3390/a5010148
Received: 15 November 2011 / Revised: 13 March 2012 / Accepted: 14 March 2012 / Published: 19 March 2012
(This article belongs to the Special Issue Puzzle/Game Algorithms)
Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest. It is natural to ask the characterization of the subsets that makes the set of interlocked polygons free (not interlocked). This abstracts the essence of a kind of sliding block puzzle. We show that any monotone Boolean function ƒ on n variables can be described by m = O(n) interlocked polygons. We also show that the decision problem that asks if given polygons are interlocked is PSPACE-complete.
Keywords: computational complexity; interlocked polygons; monotone boolean function; sliding block puzzle computational complexity; interlocked polygons; monotone boolean function; sliding block puzzle
MDPI and ACS Style

Demaine, E.D.; Demaine, M.L.; Uehara, R. Any Monotone Function Is Realized by Interlocked Polygons. Algorithms 2012, 5, 148-157. https://doi.org/10.3390/a5010148

AMA Style

Demaine ED, Demaine ML, Uehara R. Any Monotone Function Is Realized by Interlocked Polygons. Algorithms. 2012; 5(1):148-157. https://doi.org/10.3390/a5010148

Chicago/Turabian Style

Demaine, Erik D., Martin L. Demaine, and Ryuhei Uehara. 2012. "Any Monotone Function Is Realized by Interlocked Polygons" Algorithms 5, no. 1: 148-157. https://doi.org/10.3390/a5010148

Find Other Styles

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop