Math Puzzle #3

If this piece moves from h1 to a8 in as minimal moves (and minimal distance) as possible, what is the distance (by square) traveled for each of these pieces:

1. Bishop on f1
2. Queen on d1
3. Rook on h1 done by @Morvon4399
4. Rook on a1
5. King on e1
6. Knight on b1
7. Knight on g1
8. Pawn on c2 (You have to use the fact that it has to promote first before it can go to h1 )

Note: For each of the pieces, they have to get to h1 from their position, then go to a8. Knight's move is the hypotenuse of the L shape they make, not the L shape

Get anyone right you get a taco. (If nobody answered it before). You may only answer at most 2 of them. 

For the knight on g1 it can go to f3, d4, b5, c7, then finally a8 (5 squares in total travelled).

but it has to go to h1 first, and It's counted by the distance traveled, not the number of squares

Oh yeah lol I didn't read it carefully

Can the rook go from h1 to a1 and then to a8?

That would be 14 squares traveled.

good job 1 taco for u

Can the bishop from f1 go to g2 and then from g2 goes to a8?

That would be 7 squares traveled in total.

nope

For the knight the answer is 10*sqrt(5)

i think

rook on a1=21?

I mean 11*sqrt(5)