这是一个骑士选址问题，在一个标准8×8的国际象棋棋盘上，棋盘中有些格子是可能有障碍物的。已知骑士的初始位置和目标位置，你的任务是计算出骑士最少需要多少步可以从初始位置到达目标位置。-Cavalier this is a location problem, in a standard 8 × 8 chess chessboard, checkerboard lattice, some of that there may be some obstacles. Cavalier known initial position and target location, your task is to calculate the number of step-by-step Cavalier at least from the initial position to reach the goal.