You have a sliding puzzle that looks like this:

+---+---+---+
| A | B | C |
+---+---+---+
|   | D | E |
+---+---+---+
| F | G | H |
+---+---+---+

You may move a block with a letter on it to the blank space by sliding it there.

Determine the minimum number of moves it takes to put H where F is and, F where H is at the same time.(In other words, changing the configuration in row-3 from FGH to HGF.)

Note: The other pieces don't need to be in their original spots.