A* Monotone Property, Iterative Deeping A*

[@adityalaata]

why was f(n)

[@dharminshah2722]

To get the correct answer

[@aviraljanveja5155]

@@dharminshah2722 If you are on an optimal path towards the goal. Then by going to a child node n' of a node n, your path got shorter. Because you went one station further towards the destination. This is reflected in the evaluation function f(n) also. Therefore, f(n)

[@Seetibaaz]

@@aviraljanveja5155 But since f() is monotonically increasing as we move close to the goal, it should be that, f(n) >= f(nl+1)?

[@Seetibaaz]

Did you get the explanation?

[@20vedavarshithabotsa3]

That's because A* algorithm works on the basis of a priority queue sorted on f( ). If n is expanding before nl+1, doesn't it mean f(n)