I'm a retired computer engineer and I'm studying a bit of abstract algebra these days.
I have done some research on the permutation groups of puzzles I've had a copy of the full partition of the 2x2x2 Rubik's cube for a while, and I think I can say it has an interesting structure, this partition.
It's embedded in $Z^2$, but really it has a 3 dimensional structure, you can roll up a section as a cylinder, so each section is a torus, and all the tori are nested. I figured out how to use the metric the authors used to count all the permutations, to embed the flat tori as a nested structure of open 'boxes' in $Z^3$.
I can demonstrate how this is all done with (what I think I've learned about) restriction and induction. I think the puzzles, along with a partition or part of one, are a good learning tool. Lots of ways to look at different things, apart from a color map.
But about the stochastic thing; this is about counting those permutations of a puzzle which are a pattern of some kind, and how to classify them. Does anyone have any background or hints?
