Knight's swap

Swap the stars with the moons, using only knights' moves (as on a chess board). What is the smallest number of moves possible?

Problem



Swap the stars with the moons, using only knights' moves (as on a chess board).

What's the smallest number of moves possible? (Only once piece can occupy a single square at a time.)

Image
Knight's Swap