This is the follow-up question for 16 Two Colored Line Up
This time, you are not supposed to solve it, but find the worst possible arrangement for each square, which will make the number of steps maximum to solve it.
So what is the optimally minimum number of steps to obtain the correct order for the worst case scenario with a given example?
Hint: If you switch the same colored numbers among themselves (not their own locations), it requires at least 16 moves.
I am going to share the answer if noone could solve it in a week.