Beispiel #1
0
    def minimum_effort_to_travel(self, terrain):
        last_index = len(terrain) - 1
        start_point = (0, 0)
        end_point = (last_index, last_index)

        g = SquareTerrain(terrain)
        optimal = Searcher(g, start_point, end_point)
        return optimal.find_optimal_cost()