Hey, so I'm working on a simulation project and I've encountered an obstacle.
Here's a representation of the problem:
Výstřižek.PNG
I want to find a path from A to C (or C to A, doesn't really matter), that's as short as possible. The W's represent walls, that cannot be crossed. Also, the path can't be diagonal, only ortogonal.
I've been trying to come up with a solution, but no luck so far.
Is this even possible to do?
Thanks for any advice. Have a nice day.
Petr
Bookmarks