On the theoretical properties of swap multimoves

We prove that any permutation can be transformed into any other permutation by the execution of at most two swap multimoves (i.e. the diameter of the neighborhood graph is 2). We also prove that it is NP-hard to search over such a neighborhood.