Scribd
Upload
18 views12 pages

Heuristic Search Presentation

The document discusses heuristic search in artificial intelligence, highlighting its role in intelligent problem-solving and differentiating between uninformed and informed search methods. It covers various types of heuristic search, including Greedy Best-First, A*, Hill Climbing, and Beam Search, along with their pros and cons. The importance of good heuristic design and its applications in fields like GPS, game playing, and scheduling is also emphasized.

Uploaded by

bpskumar04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
18 views12 pages

Heuristic Search Presentation

The document discusses heuristic search in artificial intelligence, highlighting its role in intelligent problem-solving and differentiating between uninformed and informed search methods. It covers various types of heuristic search, including Greedy Best-First, A*, Hill Climbing, and Beam Search, along with their pros and cons. The importance of good heuristic design and its applications in fields like GPS, game playing, and scheduling is also emphasized.

Uploaded by

bpskumar04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 12

Heuristic Search in Artificial

Intelligence
• Exploring Intelligent Problem Solving
• Your Name
• Date
Introduction
• • What is Search in AI?
• • Role of search in problem-solving
• • Uninformed vs. informed (heuristic) search
What is a Heuristic?
• • A rule of thumb or educated guess
• • Guides the search process
• • Example: Manhattan distance
Types of Heuristic Search
• • Greedy Best-First Search
• • A* Search
• • Hill Climbing
• • Beam Search
Greedy Best-First Search
• • Uses only heuristic function h(n)
• • Selects node with lowest h(n)
• • Pros: Fast
• • Cons: Not always optimal
A* Search
• • f(n) = g(n) + h(n)
• • g(n): cost so far, h(n): estimated cost to goal
• • Optimal and complete (if h is admissible)
Hill Climbing
• • Moves towards increasing value
• • No backtracking
• • Issues: local maxima, ridges, plateaus
Beam Search
• • Keeps a fixed number of best paths
• • Prunes others
• • Efficient but may miss optimal solutions
Heuristic Design
• • Admissibility: never overestimates
• • Consistency: triangle inequality
• • Trade-off: speed vs. accuracy
Applications
• • GPS and pathfinding
• • Game playing (Chess, Go)
• • Scheduling problems
• • NLP tasks
Summary
• • Heuristic search is faster
• • A* is optimal with admissible heuristic
• • Good heuristic design is key
Q&A
• • Questions?

You might also like