Journal of Information Processing
The Magnets Puzzle is NP-Complete
Jonas Kölker
Author information
JOURNALS FREE ACCESS

Volume 20 (2012) Issue 3 Pages 707-708

Details
Download PDF (155K) Contact us
Abstract

In a Magnets puzzle, one must pack magnets in a box subject to polarity and numeric constraints. We show that deciding solvability of Magnets instances is NP-complete.

Information related to the author
© 2012 by the Information Processing Society of Japan
Previous article Next article

Recently visited articles
feedback
Top