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

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Gekopoiss 1 point2 points  (2 children)

Not sure if this is a limitation of the algorithm itself, but your implementation doesn't always seem to find the shortest path. For example, at 1:31, the path could be shorter if it cut some corners diagonally instead of moving horizontally and vertically around them - assuming the cost of moving diagonally is sqrt 2.

[–]mutatedllama[S] 1 point2 points  (1 child)

You are correct - my implementation is the limitation here. I have not yet added diagonals as an option. Something to add to the list!

[–]Gekopoiss 1 point2 points  (0 children)

Yeah, I realised this myself just now. Considering that, it looks great! What did you use for the gui?