Computational Complexity of Cast Puzzles
A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A cast puzzle is a type of disentanglement puzzle, where each piece is a zinc die-casting alloy. In this paper, we consider the generalized cast puzzle problem whose input is the layout of a finite number of pieces (polyhedrons) in the 3-dimensional Euclidean space. For every integer k ≥ 0, we present a polynomial-time transformation from an arbitrary k-exponential-space Turing machine M and its input x to a cast puzzle c 1 of size k-exponential in |x| such that M accepts x if and only if c 1 is solvable. Here, the layout of c 1 is encoded as a string of length polynomial (even if c 1 has size k-exponential). Therefore, the cast puzzle problem of size k-exponential is k-EXPSPACE-hard for every integer k ≥ 0. We also present a polynomial-time transformation from an arbitrary instance f of the SAT problem to a cast puzzle c 2 such that f is satisfiable if and only if c 2 is solvable.
KeywordsTuring Machine Transition Rule Rectangular Hole Simple Polyhedron Tape Cell
Unable to display preview. Download preview PDF.
- 5.Fraenkel, A.S., Lichtenstein, D.: Computing a perfect strategy for n×n chess requires time exponential in n. J. Combinatorial Theory, Ser. A 31(2), 199–214 (1981)Google Scholar
- 7.Iwamoto, C., Nishio, K.: A polynomial-time transformation of SAT-instances to cast puzzles. An unpublished manuscript, http://home.hiroshima-u.ac.jp/chuzo/IN09.pdf
- 10.Morita, K., Shirasaki, A., Gono, Y.: A 1-tape 2-symbol reversible Turing machine. Trans. IEICE E72(3), 223–228 (1989)Google Scholar
- 11.Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)Google Scholar
- 13.Robson, J.M.: The complexity of Go. In: Proc. 9th World Computer Congress on Information Processing, pp. 413–417 (1983)Google Scholar