Andre Hernandez-Espiet, Rutgers University

Abstract

In this talk I will be talking about permutation puzzles. These refer to puzzles in which every valid move performs a permutation of these numbers and can be undone. One clear example of this is the 15-puzzle. One less obvious example (at first) is the Rubik's cube. I will be giving solvability criteria, counting the number of configurations, and calculating the probability of being able to solve from a random starting point.

Presented via Zoom - Meeting ID: 984 4140 9199

https://rutgers.zoom.us/j/98441409199

Password: 715004

SEE: https://sites.math.rutgers.edu/~qcd2/GCS.html