An 'almost impossible' puzzle and group theory


‘Given a chessboard with a coin on every square randomly oriented and a key hidden under one of them; player one knows where the key is and flips a single coin; player 2, using only the information of the new coin arrangement must determine where the key is. Is there a winning strategy?’ In this talk, we will explore this classic puzzle in a more generalized context, with n squares and d sided dice on every square. We’ll see when the game is solvable and in doing so, see how the answer relies on group theory and the existence of certain groups!

Oct 6, 2021 3:30 PM — 4:30 PM
UW Madison Math Dept, Van Vleck 911
480 Lincoln Dr, Madison, WI 53706

Check out my write up for the problem!

Karan Srivastava
Karan Srivastava
PhD Student, Mathematics

My research interests include algebraic geometry, number theory, and machine learning