Scribd
Upload
43 views17 pages

Intelligent Search Algorithms: Forth Year

This document discusses intelligent search algorithms. It describes how search algorithms are used to solve problems by formulating the problem as a state space with nodes, start and goal states, and operators to move between states. It differentiates between uninformed and informed search strategies, with uninformed using arbitrary ordering and informed using heuristics. Examples of search types include breadth-first, depth-first, uniform cost, A*, and hill climbing. The document concludes by listing applications of search algorithms in problem solving, logical reasoning, planning, and language processing.

Uploaded by

Khalil Daiyob
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
43 views17 pages

Intelligent Search Algorithms: Forth Year

This document discusses intelligent search algorithms. It describes how search algorithms are used to solve problems by formulating the problem as a state space with nodes, start and goal states, and operators to move between states. It differentiates between uninformed and informed search strategies, with uninformed using arbitrary ordering and informed using heuristics. Examples of search types include breadth-first, depth-first, uniform cost, A*, and hill climbing. The document concludes by listing applications of search algorithms in problem solving, logical reasoning, planning, and language processing.

Uploaded by

Khalil Daiyob
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/ 17

Intelligent Search Algorithms

Forth Year
Eng. Mohammad Khair kibabi

B F
A G
D
H I
C
Search Algorithms
Why we search?
 Searching with single agent environment

 Searching in multi agent environment


Search Algorithms Problems
 Time Complexity
 Space complexity
 Example : Find All Solutions in
Chess !!!!
Intelligent Search Algorithms

 Human Directly go to target


but software ???? Target
Formulating The Problem
State Space :
 Start State
 Nodes : States
 Operators or actions or
B F
edges
A G
 Goals D
H I
C
Formulating The Problem

Nodes (States):
Search Strategy
 A strategy is defined by picking the order of node expansion. 1

 Strategy is evaluated among the following dimensions:


2
 Completeness- does it always find a solution if one exists?
3
 Time complexity- no. of nodes generated.
 Space complexity- max no. of nodes in memory. 4

 Optimality- does it always find least cost solution? 5

6
7
Types of Search Strategies
1 - Uninformed Search:
 Search that has no information about its domain.
 Search the number of nodes can be extremely large.
 The order of expanding the nodes is arbitrary.
 Examples:
 Breadth First Search
 Depth First Search
 Uniform Cost Search
Blind Search
Types of Search Strategies
2 - Informed Search:
 Use information about the domain to make the search process more efficient.
 Inform the search about the direction to a goal to guess which neighbor of a
node will lead to a goal.
 Examples:
 Hill Climbing
 A*
 AO*
Intelligent Search
Intelligent Search Algorithms Applications
 Problem Solving:
 Puzzles
 Play games, e.g. chess
 Scheduling
 Symbolic integration of mathematical formulas.
 Logical reasoning
 Prove assertions (theorems) by manipulating a database of facts (like prolog)
 Planning:
 find a sequence of actions to achieve a goal for a robot.
 Language:
 find the best parse of a sentence : e.g. Spelling checker
Intelligent Search Algorithms
Homework
B F
A G
D
H I
C
Zombie Klotski

http://www.kongregate.com/games/brainfeedstudios/zombie-klotski
Game states

Start State Second State Final State


Game Structure
Array ?
Pieces Movement
Print States
Intelligent Search Algorithms
Thank You
B F
A G
D
H I
C

You might also like