J-STAGE Home  >  Publications - Top  > Bibliographic Information

Journal of Information Processing
Vol. 20 (2012) No. 3 pp. 707-708

Language:

http://doi.org/10.2197/ipsjjip.20.707


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.

Copyright © 2012 by the Information Processing Society of Japan

Article Tools

Share this Article