The A* algorithm is optimal when
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. it always finds the solution with the lowest total cost if the heuristic h is admissible
Explanation
With an admissible heuristic (never overestimates), A* tree search returns a least-cost solution.More Artificial Intelligence (AI) questions
- Which artificial intelligence technique enables computers to understand the associations and relationships between objects and events?
- Where do the values of alpha–beta search get updated?
- A 4-input neuron has weights 1, 2, 3, 4. The transfer function is linear with the constant of proportionality equal to 3. The inputs are 5,…
- Which AI system mimics the evolutionary process to generate increasingly better solutions to a problem? I. Self-organising neural network I…
- Consider the following learning algorithms: I. Logistic regression II. Back propagation III. Linear regression IV. Forward propagation Whic…
- Which Boolean operations on two variables can be represented by a single perceptron layer? I. X1 AND X2 II. X1 OR X2 III. X1 NOR X2 IV. X1…