Scribd
Upload
14 views

Unit 2 - Problem Solving in AI

Unit 2 discusses problem-solving in AI through various search strategies and algorithms. It covers both uninformed and informed search methods, local search algorithms, adversarial search, and constraint satisfaction problems. These techniques are essential for optimizing solutions and making decisions in AI applications.

Uploaded by

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

Unit 2 - Problem Solving in AI

Unit 2 discusses problem-solving in AI through various search strategies and algorithms. It covers both uninformed and informed search methods, local search algorithms, adversarial search, and constraint satisfaction problems. These techniques are essential for optimizing solutions and making decisions in AI applications.

Uploaded by

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

Unit 2: Problem Solving in AI

1. Solving Problems by Searching

Problem-solving in AI involves searching for an optimal solution to a given problem. Search


algorithms explore possible states to find a sequence of actions that lead to a goal state.

2. Problem Solving Agents

A problem-solving agent is an intelligent system that uses search strategies to reach a goal.
The agent follows these steps:

1. Define the problem (initial state, goal state, actions, transition model, cost function).

2. Search for solutions using algorithms.

3. Execute the best solution to achieve the goal.

3. Searching for Solutions

 State Space Representation: Defines all possible states and transitions.


 Search Tree: Expands nodes representing states.
 Search Strategies: Methods to traverse the state space.

4. Uninformed Search Strategies (Blind Search)

Uninformed search methods do not use problem-specific knowledge:

 Breadth-First Search (BFS): Explores all nodes at the current level before moving
deeper.
 Depth-First Search (DFS): Explores as far as possible along a branch before
backtracking.
 Uniform Cost Search (UCS): Expands the least-cost node first.
 Depth-Limited Search (DLS): Limits search depth to prevent infinite loops.
 Iterative Deepening Depth-First Search (IDDFS): Combines BFS and DFS advantages.

5. Informed Search Strategies (Heuristic Search)

Informed search uses heuristics to improve efficiency:

 Greedy Best-First Search: Expands the node that appears closest to the goal.
 A* Search: Uses both path cost and heuristic function for optimal solutions.

6. Heuristic Functions

A heuristic function estimates the cost from a given state to the goal. Examples:

 Manhattan Distance: Used in grid-based pathfinding.


 Euclidean Distance: Straight-line distance heuristic.
 Admissible Heuristics: Never overestimate cost (e.g., A* search guarantees
optimality).

7. Local Search Algorithms

Local search optimizes solutions without exploring the entire space:

 Hill Climbing: Iteratively moves towards higher-value states.


 Simulated Annealing: Avoids local optima by allowing occasional worse moves.
 Genetic Algorithms: Uses evolutionary principles to find solutions.

8. Adversarial Search

Used in competitive environments like games where agents act against each other:

 Minimax Algorithm: Determines the best move by assuming optimal opponent play.
 Alpha-Beta Pruning: Optimizes minimax by cutting unnecessary branches.
 Monte Carlo Tree Search (MCTS): Used in complex games like Go.

9. Constraint Satisfaction Problems (CSPs)

A CSP consists of:

 Variables: Entities with possible values.


 Domains: Possible values each variable can take.
 Constraints: Restrictions on variable combinations.
 Solving Methods:
 Backtracking Search: Systematically explores variable assignments.
 Forward Checking: Eliminates inconsistent values early.
 Arc Consistency (AC-3 Algorithm): Ensures constraints hold before assigning values.

These problem-solving techniques form the foundation for AI applications in search,


optimization, and decision-making.

You might also like