Solving Rubik’s Cube with Non-Standard Moves
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Still another thesis on Rubik’s cube? Is there still something new to write on that puzzle? In this document, we approach the cube with a rather unusual question: “how would you solve the cube if, instead of using the 6 classical rotations, you were restricted to a set of arbitrary moves?” To answer that question, we will dive into group theory.
Inspired by some previous work on the factorization of the symmetric group, we have developed an algorithm that answers our initial question. However, being able to solve the cube with any set of moves has a trade-off: while some algorithms solve the cube in 20 moves, ours requires several thousands.
One could go further than this thesis by: improving our algorithm, providing rigourous bounds on its complexity, or generalizing the algorithm to the n × n × n cube.
Place, publisher, year, edition, pages
IdentifiersURN: urn:nbn:se:kth:diva-151379OAI: oai:DiVA.org:kth-151379DiVA: diva2:748282
Subject / course
Master of Science - Mathematics
Bauer, Tilman, LektorPereira, Olivier, Prof.
Bauer, Tilman, Lektor