We classify an algebraic phenomenon on certain families of wreath products that can be seen as coming from a family of puzzles about switches on the corners of a spinning table. Such puzzles have been written about and generalized since they were first popularized by Martin Gardner in 1979. In this paper, we provide perhaps the fullest generalization yet, modeling both the switches and the spinning table as arbitrary finite groups combined via a wreath product. We classify large families of wreath products depending on whether or not they correspond to a solvable puzzle, completely classifying the puzzle in the case when the switches behave like abelian groups, constructing winning strategies for all wreath product that are $p$-groups, and providing novel examples for other puzzles where the switches behave like nonabelian groups, including the puzzle consisting of two interchangeable copies of the monster group $M$. Lastly, we provide a number of open questions and conjectures, and provide other suggestions of how to generalize some of these ideas further.