Scribd
Upload
5 views5 pages

Heuristic_Search_

Heuristic search is an informed search technique that utilizes domain-specific knowledge to efficiently find solutions, commonly applied in AI and problem-solving algorithms. Key concepts include heuristic functions, search space, goal tests, and evaluation functions, with popular algorithms such as Best-First Search and A* Search. While heuristic search offers advantages like faster performance and reduced search space, its effectiveness is heavily reliant on the quality of the heuristic used.

Uploaded by

piyushleader12
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
5 views5 pages

Heuristic_Search_

Heuristic search is an informed search technique that utilizes domain-specific knowledge to efficiently find solutions, commonly applied in AI and problem-solving algorithms. Key concepts include heuristic functions, search space, goal tests, and evaluation functions, with popular algorithms such as Best-First Search and A* Search. While heuristic search offers advantages like faster performance and reduced search space, its effectiveness is heavily reliant on the quality of the heuristic used.

Uploaded by

piyushleader12
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/ 5

Heuristic Search in Artificial

Intelligence
An Overview of Informed Search
Strategies
Presented by Piyush Kumar
What is Heuristic Search?
• - Heuristic search uses domain-specific
knowledge to find solutions efficiently.
• - It is an informed search technique—uses a
heuristic (rule of thumb) to guide the search.
• - Often used in AI and problem-solving
algorithms.
• - Example: Finding the shortest path in Google
Maps.
Key Concepts
• - Heuristic Function (h(n)): Estimates cost from
node n to goal.
• - Search Space: All possible states that can be
explored.
• - Goal Test: Checks if the current state is the
goal.
• - Evaluation Function (f(n)): f(n) = g(n) + h(n)
• - g(n): Cost to reach node n
• - h(n): Estimated cost from n to goal
Popular Heuristic Search
Algorithms
• - Best-First Search
• - A* Search
• - Combines cost-so-far and estimated cost-
to-go
• - Optimal and complete if h(n) is admissible
• - Greedy Search
• - Uses h(n) only (not always optimal)
Advantages and Applications
• - Advantages:
• - Faster than uninformed search
• - Reduces search space
• - Applications:
• - Game playing (Chess, Tic Tac Toe)
• - Pathfinding (GPS)
• - Puzzle solving (8-puzzle)
• - Limitation: Depends heavily on the quality of
the heuristic

You might also like