Information and Media Technologies
Online ISSN : 1881-0896
ISSN-L : 1881-0896
Computing
The Magnets Puzzle is NP-Complete
Jonas Kölker
Author information
Keywords: puzzles, combinatorics, computational complexity, NP-completeness
JOURNAL FREE ACCESS

2012 Volume 7 Issue 3 Pages 1013-1014

Details
Download PDF (109K)
Download citation RIS

(compatible with EndNote, Reference Manager, ProCite, RefWorks)

BIB TEX

(compatible with BibDesk, LaTeX)

Text
How to download citation
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.
Content from these authors
© 2012 Information Processing Society of Japan
Previous article Next article
Favorites & Alerts

Recently viewed articles
Share this page
feedback
 Top