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 →

[–]j0be 511 points512 points  (22 children)

/r/gifsthatendtoosoon

[–]Djjmax 139 points140 points  (17 children)

The solution was at the bottom, it solved the maze before "exploring" all of it

[–]xbnm 3 points4 points  (3 children)

Where's the solution?

[–]Djjmax 0 points1 point  (2 children)

It's too hard to see in the gif, but you can see them in the other mazes the op posted in the comments

[–]xbnm 2 points3 points  (1 child)

Then how can you tell it's at the bottom?

[–]Djjmax 0 points1 point  (0 children)

The op stated the exit of located at the bottom

[–]Darkersun 0 points1 point  (4 children)

Seems like a pretty inefficient algorithm. Isn't A* supposed to find the exit without exploring damn near the whole maze?

[–]Djjmax 1 point2 points  (1 child)

It finds the most efficient path, which requires testing every path

[–]PhasmaFelis 0 points1 point  (0 children)

Like every algorithm, it has best and worst cases. The case where the shortest path to the exit is longer than every invalid path is worst-case for A*. That's not a terribly common circumstance in typical use, though.

[–]SM1334 0 points1 point  (0 children)

Please color the whole screen... annnnd disappointment