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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.