PDF] Solving Megaminx puzzle With Group Theory

Par un écrivain mystérieux

Last updated 27 mai 2024

PDF] Solving Megaminx puzzle With Group Theory

Megaminx is a type of combination puzzle, generalized from the conventional Rubik’s cube. Although the recipes for manually solving megaminx are known, the structure of the group of all megaminx moves remains unclear, further the algorithms for solving megaminx blindfolded are unknown. First, this work proves the structure of the megaminx group: semidirect product of a orientation twisting subgroup and a position permutation subgroup, the former subgroup is decomposed further into the product of multiplicative groups of integers modulo 2 or 3, the later subgroup is the product of alternating groups. Second, the work gives the sufficient and necessary conditions for a configuration to be solvable. Third, the work shows a constructive algorithm to solve the megaminx, which is suitable for the blindfolded competition.