Next Article in Journal / Special Issue
Imaginary Cubes and Their Puzzles
Previous Article in Journal
Content Sharing Graphs for Deduplication-Enabled Storage Systems
Previous Article in Special Issue
Finding All Solutions and Instances of Numberlink and Slitherlink by ZDDs
Article Menu

Article Versions

Export Article

Open AccessArticle
Algorithms 2012, 5(2), 261-272; doi:10.3390/a5020261

A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem

Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima, 739-8527 Japan
*
Author to whom correspondence should be addressed.
Received: 11 November 2011 / Revised: 27 February 2012 / Accepted: 7 April 2012 / Published: 13 April 2012
(This article belongs to the Special Issue Puzzle/Game Algorithms)
Download PDF [117 KB, uploaded 13 April 2012]

Abstract

A disentanglement puzzle consists of mechanically interlinked pieces, and the puzzle is solved by disentangling one piece from another set of pieces. A string puzzle consists of strings entangled with one or more wooden pieces. We consider the generalized string puzzle problem whose input is the layout of strings and a wooden board with holes embedded in the 3-dimensional Euclidean space. We present a polynomial-time transformation from an arbitrary instance ƒ of the 3SAT problem to a string puzzle s such that ƒ is satisfiable if and only if s is solvable. Therefore, the generalized string puzzle problem is NP-hard.
Keywords: disentanglement puzzle; polynomial-time reduction; NP-hard disentanglement puzzle; polynomial-time reduction; NP-hard
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Iwamoto, C.; Sasaki, K.; Morita, K. A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem. Algorithms 2012, 5, 261-272.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top