First step is the same as Greedy Best-first Search so it is the following equation if we have {C1,, C2, C3, ... , Cn} as possible destinations in our next moves and have heuristic function H(Cx) which ...

Greedy Best-First Search is an AI search algorithm that attempts to find the most promising path from a given starting point to a goal. It prioritizes paths that appear to be the most promising, ...