Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
The Magnets Puzzle is NP-Complete
Jonas Kölker
Author information
JOURNAL FREE ACCESS

2012 Volume 20 Issue 3 Pages 707-708

Details
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.

Content from these authors
© 2012 by the Information Processing Society of Japan
Previous article Next article
feedback
Top