java++迷宫选出最优距离_解决这个迷宫的最佳算法？

您需要评估每个可能的移动并采取最小距离的移动 . 类似于以下内容：

int minDistance(int x, int y, int prevX, int prevY, int distance) {

if (CollionWithBorder(x, y) // can't take this path

return int.MAX_VALUE;

if (NoCollionWithBorder(x, y) // it's OK to take this path

{

// update the distance only when there is a long change in direction

if (LongDirectionChange(x, y, prevX, prevY))

distance = distance + 1;

)

if (ReachedDestination(x, y) // we're done

return distance;

// find the path with the minimum distance

return min(minDistance(x, y + 1, x, y, distance), // go right

minDistance(x + 1, y, x, y, distance), // go up

minDistance(x - 1, y, x, y, distance), // go down

minDistance(x, y - 1, x, y, distance)); // go left

}

bool LongDirectionChange(x, y, prevX, prevY) {

if (y-2 == prevY && x == prevX) ||(y == prevY && x-2 == prevX)

return true;

return false;

}

这是假设不允许对角线移动 . 如果是，请将它们添加到min()调用：

minDistance(x + 1, y + 1, distance), // go up diagonally to right

minDistance(x - 1, y - 1, distance), // go down diagonally to left

minDistance(x + 1, y - 1, distance), // go up diagonally to left

minDistance(x - 1, y + 1, distance), // go down diagonally to right