recategorized by
1,839 views
2 votes
2 votes

If h* represents an estimate from the cost of getting from the current node N to the goal node and h represents actual cost of getting from the current node to the goal node, then A* algorithm gives an optimal solution if 

  1. h* is equal to h
  2. h* overestimates h
  3. h* underestimates h
  4. none of these
recategorized by

1 Answer

0 votes
0 votes

ans should be C   h* underestimates h .

Rule is AA∗ algorithm gives an optimal solution if  h* never  overestimates h (admissible heuristics  so b is out

underestimating  h means algo  is looking for better soln which may be found if it is there(optimal soln)

Answer:

Related questions

3 votes
3 votes
1 answer
2
go_editor asked Jul 27, 2016
2,441 views
High level knowledge which relates to the use of sentences in different contexts and how the context affect the meaning of the sentences?MorphologicalSyntacticSemanticPra...
1 votes
1 votes
1 answer
4
go_editor asked Jul 22, 2016
1,536 views
If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is Alternative solutionInfeasible solutionUnbounded solutionDe...