Conway's M(13) Puzzle
![]() The M(13) in the title refers to the pseudogroup of permutations of the 13 tiles (where we think of the open space as simply another tile bearing the number 13) which can be achieved by legal moves in the game. The subset of permutations which leave the point uncovered form a group of 95,040 elements ismorphic to the Mathieu group .To use the Solve button, make sure the position (at the top of the circle) is open. Clicking the Solve button gives a sequence of numbers that refer to the light-gray point numbers around the outside of the circle. Click those positions in the order indicated, and the puzzle will be returned to its initial state. The solver is based on the algorithm described in the following paper (which would be impractical for a human puzzler to use):J. H. Conway, N. D. Elkies, and J. L. Martin, "The Mathieu Group and Its Pseudo Group Extension ," Experimental Mathematics, 15(2), 2006 pp. 223–236. [PDF]![]() "Conway's M(13) Puzzle" from The Wolfram Demonstrations Project http://demonstrations.wolfram.com/ConwaysM13Puzzle/ Contributed by: Jacob A. Siehler | ||||||||||||||
![]() | ||
|
|
||























Browse all topics















