代码
import math
def heuristic_distace(Neighbour_node,target_node):
H = abs(Neighbour_node[0] - target_node[0]) + abs(Neighbour_node[1] - target_node[1])
return H
def go_around(direction):
box_length = 1
diagonal_line = box_length * 1
if (direction==0 or direction==2 or direction==6 or direction==8):
return diagonal_line
elif (direction==1 or direction==3 or direction==4 or direction==5 or direction==7):
return diagonal_line
def find_coordinate(map,symble):
result=[]
for index1,value1 in enumerate(map):
if symble in value1:
row = index1
for index2, value2 in enumerate(map[index1]):
if symble==value2:
column = index2
result.append([row, column])
return result
def show_map(map):
for idx in map: