code: def compute_path(self, start_x, start_y, dest_x, dest_y,
                       diagonal_cost=_math.sqrt(2)):
          
          return tcod.path.AStar(self, diagonal_cost).get_path(start_x, start_y,
                                                               dest_x, dest_y)
docs: Get the shortest path between two points.
  
          Args:
              start_x (int): Starting x-position.
              start_y (int): Starting y-position.
              dest_x (int): Destination x-position.
              dest_y (int): Destination y-position.
              diagonal_cost (float): Multiplier for diagonal movement.
  
                  Can be set to zero to disable diagonal movement entirely.
  
          Returns:
              List[Tuple[int, int]]: The shortest list of points to the
                  destination position from the starting position.
  
              The start point is not included in this list.