Show simple item record

dc.contributor.authorDemaine, Erik D
dc.contributor.authorEisenstat, Sarah Charmian
dc.contributor.authorRudoy, Mikhail
dc.date.accessioned2019-06-25T16:59:18Z
dc.date.available2019-06-25T16:59:18Z
dc.date.issued2018
dc.identifier.issn1868-8969
dc.identifier.urihttps://hdl.handle.net/1721.1/121410
dc.description.abstractIn this paper, we prove that optimally solving an n × n × n Rubik’s Cube is NP-complete by reducing from the Hamiltonian Cycle problem in square grid graphs. This improves the previous result that optimally solving an n×n×n Rubik’s Cube with missing stickers is NP-complete. We prove this result first for the simpler case of the Rubik’s Square - an n × n × 1 generalization of the Rubik’s Cube - and then proceed with a similar but more complicated proof for the Rubik’s Cube case. Our results hold both when the goal is make the sides monochromatic and when the goal is to put each sticker into a specific location.en_US
dc.language.isoen
dc.publisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatiken_US
dc.relation.isversionofhttp://dx.doi.org/10.4230/LIPIcs.STACS.2018.24en_US
dc.rightsCreative Commons Attribution 4.0 International licenseen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceDROPSen_US
dc.titleSolving the Rubik’s Cube optimally is NP-completeen_US
dc.typeArticleen_US
dc.identifier.citationDemaine, Erik D., et al. “Solving the Rubik’s Cube Optimally Is NP-Complete.” Leibniz International Proceedings in Informatics 96 (2018): n. pag. © Erik D. Demaine, Sarah Eisenstat, and Mikhail Rudoyen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.relation.journalLeibniz International Proceedings in Informaticsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-06-05T13:23:47Z
dspace.date.submission2019-06-05T13:23:48Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record