We present a simple tile-sliding game that can be played on any 3-regular graph, generating a permutation group on the vertices. We classify the resulting permutation groups and obtain a novel presentation for the simple group of 168 elements.
References
A. F. Archer, “A modern treatment of the 15 puzzle”, Amer. Math. Monthly 106:9 (1999), 793–799. MR2001a:05004 1007.00006 10.2307/2589612 A. F. Archer, “A modern treatment of the 15 puzzle”, Amer. Math. Monthly 106:9 (1999), 793–799. MR2001a:05004 1007.00006 10.2307/2589612
J. H. Conway, “$M_{13}$”, pp. 1–11 in Surveys in combinatorics, 1997, edited by R. A. Bailey, London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, 1997. MR98i:20003 0887.05002 J. H. Conway, “$M_{13}$”, pp. 1–11 in Surveys in combinatorics, 1997, edited by R. A. Bailey, London Math. Soc. Lecture Note Ser. 241, Cambridge Univ. Press, 1997. MR98i:20003 0887.05002
J. H. Conway, N. D. Elkies, and J. L. Martin, “The Mathieu group $M_{12}$ and its pseudogroup extension $M_{13}$”, Experiment. Math. 15:2 (2006), 223–236. MR2007k:20005 1112.20003 10.1080/10586458.2006.10128958 euclid.em/1175789742
J. H. Conway, N. D. Elkies, and J. L. Martin, “The Mathieu group $M_{12}$ and its pseudogroup extension $M_{13}$”, Experiment. Math. 15:2 (2006), 223–236. MR2007k:20005 1112.20003 10.1080/10586458.2006.10128958 euclid.em/1175789742
J. D. Dixon and B. Mortimer, Permutation groups, Graduate Texts in Mathematics 163, Springer, New York, 1996. MR98m:20003 0951.20001 J. D. Dixon and B. Mortimer, Permutation groups, Graduate Texts in Mathematics 163, Springer, New York, 1996. MR98m:20003 0951.20001
A. Fink and R. Guy, “Rick's tricky six puzzle: $S_5$ sits specially in $S_6$”, Math. Mag. 82:2 (2009), 83–102. MR2512593 1223.05113 10.4169/193009809X468896 A. Fink and R. Guy, “Rick's tricky six puzzle: $S_5$ sits specially in $S_6$”, Math. Mag. 82:2 (2009), 83–102. MR2512593 1223.05113 10.4169/193009809X468896
O. Goldreich, “Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard”, 1984, http://tinyurl/15puzz-pdf. preprint. http://tinyurl/15puzz-pdf O. Goldreich, “Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard”, 1984, http://tinyurl/15puzz-pdf. preprint. http://tinyurl/15puzz-pdf
D. Ratner and M. Warmuth, “The $(n^2-1)$-puzzle and related relocation problems”, J. Symbolic Comput. 10:2 (1990), 111–137. MR91i:68138 0704.68057 10.1016/S0747-7171(08)80001-6 D. Ratner and M. Warmuth, “The $(n^2-1)$-puzzle and related relocation problems”, J. Symbolic Comput. 10:2 (1990), 111–137. MR91i:68138 0704.68057 10.1016/S0747-7171(08)80001-6
R. C. Read and R. J. Wilson, An atlas of graphs, The Clarendon Press Oxford University Press, New York, 1998. MR2000a:05001 0908.05001 R. C. Read and R. J. Wilson, An atlas of graphs, The Clarendon Press Oxford University Press, New York, 1998. MR2000a:05001 0908.05001
J. A. Siehler, “Slide and swap on cubic graphs”, website, 2011, http://tinyurl.com/sandscubic. http://tinyurl.com/sandscubic J. A. Siehler, “Slide and swap on cubic graphs”, website, 2011, http://tinyurl.com/sandscubic. http://tinyurl.com/sandscubic
R. M. Wilson, “Graph puzzles, homotopy, and the alternating group”, J. Combinatorial Theory Ser. B 16 (1974), 86–96. MR48:10882 0285.05110 R. M. Wilson, “Graph puzzles, homotopy, and the alternating group”, J. Combinatorial Theory Ser. B 16 (1974), 86–96. MR48:10882 0285.05110
