Greedy best first search Algorithm take the history and then check value ans then reach to goal.
In A* search Algorithm take history and also cost then calculate value then reach to goal.
When we use greedy best first search Algorithm then start from initial then check value that taken by history then go to next node and so on. When using A* search Algorithm then start from initial then calculate value by adding cost and history value then check value and no next. In this we go back also if we see that in first level there is a small value then all node in first level or sec or so on.
MY QUESTION: Am confuse that we call A* search is best then greedy best first search when we use A* search then if we go back then we stuck in loop so how we say its best then greedy