Affiliation:
1. Math & Stats Department, University of Guelph, ONT, Canada
Abstract
In this study, the group of finite cyclic lamplighter states is reinterpreted as the novel lamplighter puzzle. The rules of the puzzle are outlined and related back to properties of the lamplighter group with specific interest placed upon the discussion of which puzzle instances are solvable. The paper shows that, through the use of algebra, many puzzle instances can be identified as solvable without the use of an exhaustive search algorithm. Solvability depends upon the creation of irregular generating sets for subgroups of the finite cyclic lamplighter group and the cosets formed by these subgroups. Further possible generalizations of the lamplighter puzzle are also discussed in closing.
Subject
Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Computational Mechanics,Computer Science (miscellaneous)
Reference13 articles.
1. Ashlock, D., Gillis, S., McEachern, A. & Tsang, J. (2016). The do what’s possible representation. In 2016 IEEE Congress on Evolutionary Computation (CEC). (pp. 1586–1593). IEEE.
2. Algorithm and bound for the greatest common divisor of n integers;Bradley;Communications of the ACM,1970
3. Clay, M. & Margalit, D. (2017). Office Hours with a Geometric Group Theorist. Princeton University Press.
4. Dead end words in lamplighter groups and other wreath products;Cleary;Quarterly Journal of Mathematics,2005
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L. & Stein, C. (2009). Introduction to Algorithms. MIT Press.