This puzzle is a replica of a game that Jerry saw on Joe's phone on Saturday, Dec 17, 2011.
There are no impossible positions. To PROVE this requires an algorithm that shows that:
can be changed to:
Through trial and error, I've come up with:
d d a a b b c c a c d d b d d a d d c c d
This is 21 steps long, and requires all four buttons. I suspect there are shorter algorithms;
I doubt that the transformation can be done with only two buttons. If you think you have such
an algorithm, please let me know at email@example.com .
Hope you enjoyed this puzzle, and thanks to Webmaster Andrew for putting in this easter egg.