No solution is possible for n > 3, because the number of swaps is far fewer than the number of permutations, but the Steinhaus–Johnson–Trotter algorithm describes the motion of particles with non-constant speeds that generate all permutations.
Nije moguće rešenje za n > 3, pošto je broj zamena daleko manji od broja permutacija, ali Steinhaus-Johnson-Trotter algoritam opisuje kretanje čestica sa nekonstantnom brzinom koja generiše sve permutacije.