See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
12 questions from this quiz
The shortest path
The total estimated cost
Cost from start to current node
Heuristic estimate to target
Node with lowest f(n)f(n)f(n)
For horizontal and vertical only
(x1−x2)2+(y1−y2)2\sqrt{(x_1 - x_2)^2 + (y_1 - y_2)^2}(x1−x2)2+(y1−y2)2
It never overestimates cost
8
Dijkstra's and Greedy Best-First
May miss the shortest path
Reconstruct the path
Select your subjects, and get access to A+ resources today.