What is the key advantage of A* over greedy best-first search?
- Faster but inaccurate
- Considers both path cost and heuristic
- Uses no memory
- Ignores heuristics
Explanation
A* uses f(n)=g(n)+h(n), combining actual cost and heuristic for optimal paths.
Related MCQs
- Unsupervised Learning
- Deep Learning
- Supervised Learning
- Reinforcement Learning
اس سوال کو وضاحت کے ساتھ پڑھیں
- Adaptive Interface
- Augmented Information
- Artificial Intelligence
- Automated Intelligence
اس سوال کو وضاحت کے ساتھ پڑھیں
- John McCarthy
- Marvin Minsky
- Geoffrey Hinton
- Alan Turing
اس سوال کو وضاحت کے ساتھ پڑھیں
- Translate languages
- Compute fast
- Exhibit human-like intelligence
- Store data
اس سوال کو وضاحت کے ساتھ پڑھیں
- Artificial General Intelligence
- A spam email filter
- A self-aware robot
- A conscious machine
اس سوال کو وضاحت کے ساتھ پڑھیں
