W W W - B B B
6 coins are arranged in a row as above:
3 colored White and 3 colored Black,
with 1 empty space between the two sets.
Object is to reverse the positions, moving
all B's to where W's are now, and moving
all W's to where B's are now.
A coin may jump over ONLY ONE adjacent coin
to an adjacent space, or it may be moved
ONLY ONE space to an empty space.
W's can only move to the right
and B's can only move to the left.
What is the least number of moves required
to reverse the positions ?
We're all here because we're not all there !