People who code: we want your input. Take the Survey

Questions tagged [consistent-heuristic]

For questions related to consistent heuristics, which are heuristics whose estimate is always less than or equal to the estimated distance from any neighboring vertex to the goal, plus the cost of reaching that neighbor.

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with

Given an admissible/consistent heuristic $h(n)$, would the tree and graph search versions of A* return the optimal path with $g(n)=2h(n)$?

I know that, if the heuristic function is admissible and consistent, then the A* algorithm always returns an optimal solution. But for the following situation, does A* search return optimal solution? ...