Implement Magic Dictionary

[awice]

---

Click here to see the full article post

[sharathnarayan]

@awice Why is the answer for below data 15?
[[2,3, 4],[7,1,6],[5,9,8]].
Shouldn't it be 11?

Path taken,
2-3-4-1-5-1-6-1-7-1-8-9
Totally 11 steps.

Am i missing something?

[awice]

@sharathnarayan Wrong forum topic, and the answer is (perhaps?) because the path is 4-directional.

[HarveyW]

Actually you should phrase as Dijkstra's is a special case of A* search with node.h = 0 always.

[Ark-kun]

The description does not clearly state that the tree cells are passable.

[MyUmmaGumma]

Just want to compliment the conciseness of the Java code here! Amazing!

[yorkshire]

Why does it say that python BFS and A* are accepted?

[aaa80247617]

A* algorithm cannot always give us the shortest path. Why does this algorithm work?