def visit_all(orig ,gx0, gy0, gz0, gx1, gy1, gz1, model ):
if gx0 == gx1 and gy0 == gy1 and gz0 == gz1:
return True
if .99<model[gx0, gy0, gz0]<1.01 and orig != (gx0,gy0,gz0):
return False
miner = 1000000
move= [0,0,0]
for i in [-1,0,1]:
for j in [-1,0,1]:
for k in [-1,0,1]:
dist = distance.euclidean((gx0+i,gy0+j,gz0+k), (gx1,gy1,gz1))
if dist < miner:
miner = dist
move = (gx0+i,gy0+j,gz0+k)
return visit_all(orig, move[0],move[1],move[2],gx1, gy1, gz1, model)
评论列表
文章目录