Bruce Norskog's cycle would work, but it will require executing somewhere around 43,252,003,274,489,855,999 moves (at worst) to arrive at the solution to a given scramble. :)