Theorem 3.2 ([1]}) 

Let \(T\)  be a transposition tree having \(n\)  vertices. Given an initial position \(P\)  for a permutation puzzle on \(T\) , the final position \(Q\)  for the puzzle can be reached by legal moves in the following number of steps
