def test_linear_distance_to_goal(self):
t1 = basic_map.Tile("",0,0)
t2 = basic_map.Tile("",9,0)
max_x = 10
max_y = 10
test_distance = utils.getLinearDistance(t1,t2,max_x,max_y, True, True)
self.assertEqual(test_distance, 1)
t3 = basic_map.Tile("",0,0)
t4 = basic_map.Tile("",0,9)
test_distance = utils.getLinearDistance(t3,t4,max_x,max_y, True, True)
self.assertEqual(test_distance, 1)
t5 = basic_map.Tile("",0,0)
t6 = basic_map.Tile("",0,4)
test_distance = utils.getLinearDistance(t5,t6,max_x,max_y, True, True)
self.assertEqual(test_distance, 4)
t7 = basic_map.Tile("",0,0)
t8 = basic_map.Tile("",0,5)
test_distance = utils.getLinearDistance(t7,t8,max_x,max_y, True, True)
self.assertEqual(test_distance, 5)
t9 = basic_map.Tile("",0,0)
t10 = basic_map.Tile("",0,0)
test_distance = utils.getLinearDistance(t9,t10,max_x,max_y, True, True)
self.assertEqual(test_distance, 0)
def test_linear_distance_to_goal(self):
t1 = basic_map.Tile("", 0, 0)
t2 = basic_map.Tile("", 9, 0)
max_x = 10
max_y = 10
test_distance = utils.getLinearDistance(t1, t2, max_x, max_y, True,
True)
self.assertEqual(test_distance, 1)
t3 = basic_map.Tile("", 0, 0)
t4 = basic_map.Tile("", 0, 9)
test_distance = utils.getLinearDistance(t3, t4, max_x, max_y, True,
True)
self.assertEqual(test_distance, 1)
t5 = basic_map.Tile("", 0, 0)
t6 = basic_map.Tile("", 0, 4)
test_distance = utils.getLinearDistance(t5, t6, max_x, max_y, True,
True)
self.assertEqual(test_distance, 4)
t7 = basic_map.Tile("", 0, 0)
t8 = basic_map.Tile("", 0, 5)
test_distance = utils.getLinearDistance(t7, t8, max_x, max_y, True,
True)
self.assertEqual(test_distance, 5)
t9 = basic_map.Tile("", 0, 0)
t10 = basic_map.Tile("", 0, 0)
test_distance = utils.getLinearDistance(t9, t10, max_x, max_y, True,
True)
self.assertEqual(test_distance, 0)
def getLinearDistanceToGoal(self, x, y) -> int:
"""
#Acts as heuristic for A-star algorithm. Gets distance between given point and the goal.
"""
map = self.map
return utils.getLinearDistance(basic_map.Tile("placeholder",x,y), self.goal, map.max_x, map.max_y, map.wrap_x, map.wrap_y)
def getLinearDistanceToGoal(self, x, y) -> int:
"""
#Acts as heuristic for A-star algorithm. Gets distance between given point and the goal.
"""
map = self.map
return utils.getLinearDistance(basic_map.Tile("placeholder", x,
y), self.goal, map.max_x,
map.max_y, map.wrap_x, map.wrap_y)
