Message #3008

From: Jon Scott <joebrian.jasmon@gmail.com>
Subject: Efficiency of solving a permutation puzzle
Date: Mon, 02 Jun 2014 20:46:17 -0700

Greetings All,

I am astonished to read that an optimal solution to the Rubik’s Cube
puzzles may not require exponential time! I am also quite intrigued to find
other interested in the computational side to this as well.
I have some thoughts to share on permutation puzzles. Finding an optimal
may or may not require exponential time, but is it known that finding a
solution can be done in at worst, polynomial time? I haven’t found mention
of this anywhere.

Group Thoughts?
Jon Scott