CODEWITHSUNDEEP
pythonmanhattan
Daniel
Daniel

Reputation: 239

Manhattan distance with impassible tiles - python

I have a 2D map (represented as list of lists) in python. Each cell has a boolean value: if the value is True the user can walk through the tile, and if the value is False the user can't walk through it.

Is there a function that can help me find the shortest path (or even just its length, similar to Manhattan distance) between two tiles (that does not include impassible tiles)?

Upvotes: 0

Views: 10

Answers (0)

Related Questions