We have a chess board. It has 8*8 grids, the index from bottom to top is 1-8, from left to right is a-h. The knight moves a 3*2 square at each step. Give you the start position of the knight, please find the minimum number of steps he should perform to reach the end position.