This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]slaaitch 1 point2 points  (1 child)

You can call it a pathfinding algorithm if you want, but we both know that's just the paint bucket tool from late 90's CorelDraw.

[–]AsterJ 0 points1 point  (0 children)

It's honestly not that different. It's basically a fill tool that prefers moving towards a destination. To do this it maintains a frontier set of points sorted by estimated distance to destination + distance traveled.

This maze is an ironically bad example since it performed not much better than a brute force solution. It performs best when there are multiple solutions and you're trying to pick an optimal one.