Artificial Intelligence AI Basics

Module-1 Artificial Intelligence
Module 1
Problems- problem spaces and search, production systems, Problem
characteristics, Searching strategies Generate and Test, Heuristic
Search Techniques- Hill climbing issues in hill climbing, General
Example Problems. Python-Introduction to Python- Lists Dictionaries &
Tuples in Python- Python implementation of Hill Climbing
ARTIFICIAL INTELLIGENCE
Artificial Intelligence is the branch of computer science

concerned with making computers behave like humans.
It can also be defined as "the study and design of intelligent
agents," where an intelligent agent is a system that perceives its
environment and takes actions which maximize its chances of
success.
John McCarthy, who coined the term in 1956, defines it as "the
science and engineering of making intelligent machines, especially
intelligent computer programs."
AI APPRAOCHES
Systems that think like humans Systems that think rationally

(1) Cognitive science Approach (2) Laws of thought Approach
Systems that act like humans Systems that act rationally

(3) Turing Test Approach (4) Rational Agent Approach
Acting humanly: The Turing Test approach

o Test proposed by Alan Turing in 1950
o The computer is asked questions by a human interrogator.
The computer passes the test if a human interrogator, after posing

some written questions, cannot tell whether the written responses
come from a person or not. Programming a computer to pass, the
computer need to possess the following capabilities:
Natural language processing to enable it to communicate

successfully in English.
SJCET Page 1
Knowledge representation to store what it knows or hears

Automated reasoning to use the stored information to
answer questions and to draw new conclusions.
Machine learning to adapt to new circumstances and to
detect and extrapolate patterns
To pass the complete Turing Test, the computer will need
Computer vision to perceive the objects, and

Robotics to manipulate objects and move about.
Thinking humanly: The cognitive modeling approach

We need to get inside actual working of the human mind which
can be achieved:
Through introspection trying to capture our own thoughts
as they go by;
Through psychological experiments
GPS, the General Problem Solver tried to trace the reasoning
steps to traces of human subjects solving the same problems.
The interdisciplinary field of cognitive science brings together
computer models from AI and experimental techniques from
psychology to try to construct precise and testable theories of the
workings of the human mind.
Thinking rationally : The laws of thought approach

The Greek philosopher Aristotle was one of the first to attempt to
codify right thinking.
His syllogism provided patterns for argument structures that
always yielded correct conclusions when given correct premises
for example, Socrates is a man; all men are mortal; therefore
Socrates is mortal.
These laws of thought were supposed to govern the operation of the
mind;their study initiated a field called logic.
SJCET Page 2
Acting rationally : The rational agent approach

An agent is something that acts. Computer agents are not mere
programs ,but they are expected to have the following attributes
operating under autonomous control,
perceiving their environment,
persisting over a prolonged time period,
adapting to change.
A rational agent is one that acts so as to achieve the best outcome.
STRONG AI,SUPER INTELLIGENCE AND WEAK AI
STRONG AI/HARD AI
Generally, artificial intelligence research aims to create AI that

can replicate human intelligence completely.
Strong AI refers to a machine that approaches or

supersedes human intelligence,
If it can do typically human tasks,
If it can apply a wide range of

background knowledge and
If it has some degree of self-

consciousness.
Strong AI aims to build machines whose overall intellectual

a b i l i t y is indistinguishable from that of a human being.
WEAK AI /SOFT AI
o Weak AI refers to the use of software to study

or accomplish specific problem solving or
reasoning tasks that do not encompass the full
range of human cognitive abilities.
o Example : a chess program such as Deep Blue.
o Weak AI does not achieve self-awareness; it
SJCET Page 3
demonstrates wide range of human-level cognitive

abilities; it is merely an intelligent, a specific problem-
solver.
IMPORTANCE OF AI IN MODERN ERA

(APPLICATIONS OF AI)
AI currently encompasses a huge variety of subfields, ranging from

general purpose areas such as learning and perception to such specific
tasks as playing chess, proving mathematical theorems, writing poetry
and diagnosing diseases.
Main application areas are:

1. Autonomous planning and scheduling
A hundred million from Earth, NASAs Remote agent program became
the first onboard autonomous planning program to control the
scheduling of operations of a space craft.
2. Autonomous control
The ALLVINN computer vision system was trained to steer a car to
keep it following a lane. It was placed in CMUs NAVLAB computer
controlled minivan and used to navigate across the United States.
NAVLAB has video camera that transmit rode images to ALVINN which
then computes the best direction to steer based on experience from
previous training runs.
3. Diagnosis
Medical diagnosis program was able to diagnose various diseases
and gave explanation for diagnosis.
4. Logistics Planning
To do automated logistic planning and scheduling for
transportation. This involved up to 50,000 vehicles, cargo, and people at
a time, and had to account for starting points, destinations, routes and
conflict resolution among all parameters.
5. Robotics
The AI technique was able to create three dimensional models of a
patients internal anatomy.
SJCET Page 4
6. Game playing
We can buy machines that can play master level chess for a few
hundred dollars. There is some AI in them, but they play well against
people mainly through brute force computation--looking at hundreds of
thousands of positions. To beat a world champion by brute force and
known reliable heuristics requires being able to look at 200 million
positions per second.
7. Speech recognition
In the 1990s, computer speech recognition reached a practical

level for limited purposes. Thus United Airlines has replaced its keyboard
tree for flight information by a system using speech recognition of flight
numbers and city names. It is quite convenient. On the other hand, while
it is possible to instruct some computers using speech, most users have
gone back to the keyboard and the mouse as still more convenient.
8. Understanding natural language
Just getting a sequence of words into a computer is not enough.

Parsing sentences is not enough either. The computer has to be provided
with an understanding of the domain the text is about, and this is
presently possible only for very limited domains.
9. Computer vision
The world is composed of three-dimensional objects, but the inputs

to the human eye and computers' TV cameras are two dimensional.
Some useful programs can work solely in two dimensions, but full
computer vision requires partial three-dimensional information that is
not just a set of two-dimensional views. At present there are only limited
ways of representing three-dimensional information directly, and they are
not as good as what humans evidently use.
SJCET Page 5
10. Expert systems
Expert knowledge is a combination of theoretical understanding of the

problem and a collection of heuristic problem solving rules that
experience has shown to be effective in the domain.
Expert systems are constructed by obtaining this knowledge from a
human expert and coding it into a form that a computer may apply to
similar problems.
To develop such a system, we must obtain knowledge from a human
domain expert.
The domain expert provides the necessary knowledge of the problem
domain.
The AI specialist is responsible for implementing this knowledge in a
program. Once such a program has been written, it is necessary to refine
its expertise through a process of giving it example problems to solve and
making any required changes or modifications to the programs
knowledge.
Dendral is an expert system designed to infer the structure of organic
molecules from their chemical formulas and mass spectrographic
information about the chemical bonds present in the molecules.
11. Heuristic classification
One of the most feasible kinds of expert system given the present
knowledge of AI is to put some information in one of a fixed set of
categories using several sources of information. An example is advising
whether to accept a proposed credit card purchase. Information is
available about the owner of the credit card, his record of payment and
also about the item he is buying and about the establishment from which
he is buying it (e.g., about whether there have been previous credit card
frauds at this establishment).
12. Commonsense reasoning
It is the branch of Artificial intelligence concerned with replicating

human thinking. In theory, if the computer is endowed with good
Knowledge Representation Database, including a comprehensive
SJCET Page 6
common sense database, and is able to process and respond in plain-text

English, it will have the ability to process and reason with English texts.
The task of Common Sense Knowledge is probably the least studied area,
though it is included in many ways in knowledge representation task.
There are two issues with this ,one is how to represent the knowledge
gathered in a computer , and human accessible way. The second task is
actually collecting the Common Sense knowledge. There are a couple of
different groups who are doing this now. Knowledge Gathering is usually
done for expert systems and is limited in its breadth to a limited domain.
The two common sense projects are Open Mind Common Sense. To
investigate this sort of problems General Problem Solver was developed.
INTELLIGENT AGENTS
An agent is anything that can be viewed as perceiving its

environment through sensors and acting upon that environment
through actuators
Human agent: eyes, ears, and other organs for sensors; hands,
legs, mouth, and other body parts for actuators
Robotic agent: cameras and infrared range finders for sensors;
Various motors for actuators
The agent function maps any given percept sequence to

actions:
[f: P* A] where P* percept sequence and A denotes
actions
The agent function for an artificial agent will be implemented
by an agent program.
SJCET Page 7
The agent function is an abstract mathematical description,

while an agent program is a concrete implementation,
running on the agent architecture
For example, in case of vacuum-cleaner world problem
Percept Sequence Action

[A, Clean] Right
[A, Dirty] Suck
[B, Clean] Left
[B, Dirty] Suck
[A, Clean], [A, Clean] Right
[A, Clean], [A, Dirty] Suck

Figure Partial tabulation of a simple agent function
for the vacuum-cleaner world shown in Figure 1.3.
Rational agents
An agent should strive to "do the right thing", based on what it can
perceive and the actions it can perform. The right action is the one
that will cause the agent to be most successful
Performance measure is an objective criterion for success of an
agent's behavior
E.g., performance measure of a vacuum-cleaner agent could be
amount of dirt cleaned up, amount of time taken, amount of
electricity consumed, amount of noise generated, etc.
Rational Agent is the one with which for each possible percept
sequence, it should select an action that is expected to maximize
its performance measure, given the evidence provided by the
percept sequence and whatever built-in knowledge the agent has.
Rationality is distinct from omniscience (all-knowing with infinite
knowledge)
Agents can perform actions in order to modify future percepts so
as to obtain useful information (information gathering, exploration)
An agent is autonomous if its behavior is determined by its own
experience (with ability to learn and adapt)
SJCET Page 8
PEAS: (Performance measure, Environment, Actuators,

Sensors)
Must first specify the setting for intelligent agent design
Consider, e.g., the task of designing an automated taxi driver:
Performance measure: Safe, fast, legal, comfortable trip, maximize
profits
Environment: Roads, other traffic, pedestrians, customers
Actuators: Steering wheel, accelerator, brake, signal, horn
Sensors: Cameras, sonar, speedometer, GPS, odometer, engine
sensors, keyboard
Similarly for the task of designing an Interactive English tutor
Performance measure: Maximize student's score on test
Environment: Set of students
Actuators: Screen display (exercises, suggestions, corrections)
Sensors: Keyboard
Environment types
Fully observable vs. partially observable: If an agent's sensors give it

access to the complete state of the environment at each point in time,
then the task environment is fully observable.
An environment is partially observable because of noisy and inaccurate
sensors or because parts of the state are simply missing from the sensor
data.
Deterministic vs. stochastic: If the next state of the environment is
completely determined by the current state and the action executed by
the agent, then the environment is said to be deterministic. If the
environment is partially observable, then it could appear to be
stochastic. That is when the environment is complex, making it hard to
keep track of all unobserved aspects,(Example, in case of taxi driving, it
is not possible to predict exactly the nature of traffic).
If the environment is deterministic except for the actions of other agents,
then the environment is strategic.
Episodic vs. sequential: The agent's experience is divided into atomic
"episodes" each episode consists of the agent perceiving and then
performing a single action, and the choice of action in each episode
depends only on the episode itself i.e. the next episode does not depends
on the actions in the previous episodes. In sequential environments on
the other hand the current decision could affect all future decisions.
SJCET Page 9
Static vs. dynamic: The environment is unchanged while an agent is

deliberating. The environment is semi dynamic if the environment itself
does not change with the passage of time but the agent's performance
score does. Dynamic environment on the other hand continuously ask
the agent what it wants to do,i.e, the environment can change while an
agent is deliberating.
Discrete vs. continuous: The discrete/continuous distinction can be

applied to the state of the environment ,to the way time is handled, and
to the percepts and actions of the agent.
For example, the discrete-state environment such as chess game has a
finite number of distinct states. Taxi driving is a continuous state and
continuous time problem.
Some Agent Types
Table-driven agents
use a percept sequence/action table in memory to find the
next action. They are implemented by a (large) lookup table.
Simple reflex agents
are based on condition-action rules, implemented with an
appropriate production system. They are stateless devices
which do not have memory of past world states.
Agents with memory
have internal state, which is used to keep track of past
states of the world.
Agents with goals

are agents that, in addition to state information, have goal
information that describes desirable situations. Agents of
this kind take future events into consideration.
Utility-based agents
base their decisions on classic axiomatic utility theory in
order to act rationally.
Draw Backs of Table-driven agents
Table lookup of percept-action pairs defining all possible

condition-action rules necessary to interact in an environment
Problems
Too big to generate and to store (Chess has about 10^120
states, for example)
SJCET Page 10
No knowledge of non-perceptual parts of the current state

Not adaptive to changes in the environment; requires entire
table to be updated if changes occur
Looping: Can't make actions conditional
Take a long time to build the table

No autonomy
Even with learning, need a long time to learn the table entries
PROBLEM-SOLVING AGENTS
A Problem solving agent is a goal-based agent. It decide what to do by
finding sequence of actions that lead to desirable states. The agent can
adopt a goal and aim at satisfying it.
Goals help organize behavior by limiting the objectives that the

agent is trying to achieve. Goal formulation based on the current
situation and the agents performance measure is the first step in
problem solving. The agents task is to find out which sequence of actions
will get it to a goal state. Problem formulation is the process of deciding
what actions and states to consider given a goal.
An agent first formulates a goal and a problem, searches for a sequence

of actions that would solve the problem and then executes the actions
one at a time.
SJCET Page 11
The process of looking for such a sequence is called search. A

search algorithm takes a problem as input and returns a solution in the
form of an action sequence.
Once a solution is found the actions it recommends can be carried out,

It then uses the solution to guide its actions, doing whatever the solution
recommends as the next thing to do-typically, the first action of the
sequence-and then removing that step from the sequence.
Once the solution has been executed, the agent will formulate a new
goal.
This is called execution phase. Thus we have a simple formulate,

search, execute design for an agent.
Usually the environment is assumed to be static because formulating

and solving the problem is done without paying attention to any changes
that might be occurring in the environment.
PROBLEM ,PROBLEM SPACES AND SEARCH

To build a system to solve a particular problem, it is necessary to
1) Define the problem precisely. The definition must include precise

specifications of what the initial situations will be as well as what
final situations constitute acceptable solutions to the problem.
2) Analyse the problem
3) Isolate and represent the task knowledge that is necessary to solve
the problem.
4) Choose the best problem solving technique and apply it to the
particular problem.
PROBLEMS AS A STATE SPACE SEARCH
State space search is a powerful technique for solving problems.

However, in order to apply this technique we need to formulate the
problem. A problem can be defined formally by 4 components:
Initial state :- Specify one or more states within that space that
describe possible situations from which the problem solving
process may start. These states are called the initial sates.
SJCET Page 12
Successor function S(x) :- Description of all possible actions

available. Given a particular state x, S(x) returns a set of < action,
successor> ordered pairs in which each action is one of the legal
actions in state x and each successor is a state that can be
reached from x by applying the action.
Goal Test : Goal states are one or more states that would be
acceptable as solutions to the problem. Goal test determines
whether a given state is a goal state. They may or may not be
explicitly specified.
Path cost :- Function that assigns a numeric cost to a path. It is
usually the sum of the costs of individual actions along the path.
Step cost of taking action a to go from state x to y is denoted by
c(x,a,y).
Problem Space is the environment in which search takes place.

Problem Instance is the problem space combined with initial and goal
state.
State space is the set of all states reachable from the initial
state.(initial state + successor function).State space forms a graph in
which nodes are states and the arcs between nodes are actions. A path
in state space is a sequence of states connected by a sequence of actions.
A solution is a sequence of actions (path) leading from the initial state

to a goal state. Solution quality is measured by the path cost function.
An Optimal solution has the lowest path cost among all solutions.
Example :Legal chess move
.
Initial State: The starting position can be described as an 8 by 8 array.
SJCET Page 13
Goal State: any board position in which the opponent does not have a
legal move and his or her king is under attack.
Successor function: The legal moves can be described as a set of rules

consisting of two parts: A left side that gives the current position and the
right side that describes the change to be made to the board position. An
example is shown in the following figure.
Current Position
While pawn at square ( 5 , 2), AND Square ( 5 , 3 ) is empty, AND
Square ( 5 , 4 ). is empty.
Changing Board Position
Move pawn from Square (5 , 2 ) to Square ( 5 , 4 ) .
The current position of a coin on the board is its STATE and the set of
all possible STATES is STATE SPACE. One or more states where the
problem terminates is FINAL STATE or GOAL STATE.
Example Problems
Problems can be classified as toy problems and real world

problems.
A toy problem is intended to illustrate or exercise various problem
solving methods. It can be used by different researchers to
compare the performance of algorithms.
A real world problem is one whose solutions people actually care
about.
TOY PROBLEM
1,Vacuum World Example
The agent is in one of the 2 locations, each of which might or might not
contain dirt. Any state can be designated as the initial state. After trying
these actions (Left, Right, Suck), we get another state. The goal test
checks whether all squares are clean.
The state space for the vacuum world. Arcs denote actions: L = Left,R =
Right,S = Suck
SJCET Page 14
2. 8 Puzzle
The eight puzzle consists of a three by three board with eight

numbered tiles and a blank space. A tile adjacent to the blank space can
slide into the space. A game consists of a starting position and a
specified goal position. The goal is to transform the starting position into
the goal position by sliding the tiles around. The object is to figure out
the steps needed to get from one configuration of the tiles to another.
Arrange the tiles so that all the tiles are in the correct positions.
You do this by moving tiles. You can move a tile up, down, left, or right,
so long as the following conditions are met:
A) there's no other tile blocking you in the direction of the movement;
and
B) you're not trying to move outside of the boundaries/edges.
The 8-puzzle - also known as the sliding-block/tile-puzzle - is

one of the most popular instrument in the artificial intelligence (AI)
studies. It belongs to AI exercises commonly referred as toy-problems.
For example, suppose we wanted to get from the initial state to the goal
state given below.
SJCET Page 15
Initial state: Goal state:
and the is a blank tile you can slide around. This 8 puzzle instance
can be solved in 5 steps.
1. States A state description specifies the location of each of the eight

tiles and the blank in one of the nine squares.
2. Initial state Any state can be designated as the initial state. Any
given goal can be reached from exactly half of the possible initial states.
3. Successor function. generates the legal states that result from
trying the four actions(blank moves left, right, up, down).
4. Goal test this checks whether the state matches the goal
configuration.
5. Path cost - Number of actions to reach goal.
3. 8-Queens Problem
The goal of 8-queens problem is to place 8 queens on a 8 by 8

chess board so that no queen can attack any other queen. A queen
attacks another if they are in the same row either vertically, horizontally,
or diagonally.
If we want to find a single solution, it is not difficult. If we want to

find all possible solutions, the problem is difficult and backtrack method
is the only known method. For 8-queen, we have 92 solutions. If we
exclude symmetry, there are 12 solutions.
One Solution to the 8-Queens Problem:
7 X
6 X
5 X
4 X
3 X
2 X
1 X
0 X
SJCET Page 16
0 1 2 3 4 5 6 7
Although efficient special purpose algorithms exist for this problem

and the whole n queens family, it remains an interesting test problem
for search algorithms. There are 2 main kinds of formulation.
1.Incremental formulation involves operators that augment the state

description starting with an empty state , ie each action adds a queen to
the board.
2.Complete-state formulation starts with all 8 queens on the board
and moves them abroad.
In either case the path cost is of no interest because only the final
state counts.
For eg: Incremental formulation
1. States - Any arrangement of 0 to 8 queens on the board
2. Initial state - No queens on the board
3. Successor function - Add a queen to any empty square
4. Goal test - 8 queens on board and none attacked
There are 3 x 1014 possible sequences to investigate
4. Water-Jug Problem
You are given two jugs a 4-gallon one and other 3-gallon one.
Neither has any measuring marker on it. There is a pump that can be
used to fill the jugs with water. The Problem : How can you get exactly 2
gallons of water into the 4-gallon jug?
The State Space for this problem can be described as a set of

Ordered pairs of integers (x, y) such that x = 0, 1, 2, 3, or 4 and y =
0, 1, 2 , or 3; x represents the number of gallons of water in the 4-
gallon jug and y represents the number of gallons of water in the
3-gallon jug.
The goal state is (2,n)
The Start State is (0, 0).The Goal States are (2, 0), (2, 1), (2, 2), (2,
3).
The actions include:
o The solution for the water jug problem is obtained by
applying the rules in the order 2-9-2-7-5-9
But this water Jug problem raises some issues
SJCET Page 17
ISSUES
1. The issue in Rule 3 and Rule 4 is that should they or should

they not be included in the list of available operators. Emptying an
unmeasured amount of water on to the ground is certainly allowed by
the problem statement. But doing so will never get us closer to a
solution.
2. Rule 11 and Rule 12 raises another issue. To explain this

issue just analyses figure 2.4. Once the state (4, 2) is reached it is
obvious what to do next. The decide 2 gallons have been produced, but
they are in wrong jug so the thing to do is to move them (Rule 11). But
before that can be done the water that is already in 4 gallon jug must be
emptied out ( Rule 12). But these rules do not actually add power to the
system since the operations they describe are already provided by rule 9 (
in the case of rule 11) and by rule 5 ( in the case of rule 12). In fact
depending on the control strategy that is used for selecting rules to use
during problem solving, the use of these rules may d grade performance.
1. (x, y) (4, y) if x < 4 Fill the 4 gallon jug
2. (x, y) (x, 3) if y < 3 Fill the 3 gallon jug
3. (x, y) (x d, y) if x > 0 Pour some water out of 4

gallon jug
4. (x, y) (x, y d) if y > 0 Pour some water out of 3

gallon jug
5. (x, y) (0, y) if x > 0 Empty the 4 gallon jug on the

ground
6. (x, y) (x, 0) if y > 0 Empty the 3 gallon jug on the

ground
7. (x, y) (4, y (4 x))
if x + y 4, y > 0 Pour water from 3 gallon to 4 gallon

jug
8. (x, y) (x (3 y), 3)
SJCET Page 18
if x + y 3, x > 0 Pour water from 4 gallon to 3 gallon

jug
9. (x, y) (x + y, 0)
if x + y 4, y > 0 Pour all water from 3 gallon to 4

gallon jug
10.(x, y) (0, x + y)
if x + y 3, x > 0 Pour all water from 4 gallon

to 3 gallon jug
11.(0, 2) (2, 0) Pour the 2gallons from the 3

gallons jug to 4 gallon jug
12.(2, y) (0, y) Empty the 2gallons in 4

gallon jug on ground.
Gallons in the 4 gallon jug Gallons in the 3 gallon

Rule Applied
0 0
0 3
2
3 0
9
3 3
2
4 2
7
0 2
5 or 12
2 0
9 or 11
SJCET Page 19
Summarizing water jug problem
1. Define a state space that contains all possible configurations of

the relevant object eg: Rules
2. Specify one or more state with in the space as start state. This
is termed as initial state.
3. Specify one or more state that would be acceptable as solution

to the problem. These state is termed as goal state.
4. Set of assumptions
It includes set of stated or unstated assumptions
Eg:- in water jug problem we assumed that we can fill a jug from
the pump, we can pour the water out of jug on to the ground, there are
no other measuring devises available and there are no measuring
markers on the jug.
5. Towers of Hanoi
There are three posts 1, 2, and 3. One of which, say post 1, has n
disks on it in ascending size. The Problem is: How to transfer all disks
from the post 1 to post 2, keeping the order of ascending size. Each time
only one disk can be moved. Post 2 is used for the intermediate storage
A good example of a problem solving domain is the "Tower of

Hanoi" puzzle. This puzzle involves a set of three rings of different sizes
that can be placed on three different pegs, like so:
The goal of this puzzle is start with the rings arranged as shown above,
and to move them all to this configuration:
SJCET Page 20
Only the top ring on a peg can be moved, and it may only be placed on a
smaller ring, or on an empty peg. For the Tower of Hanoi, the problem
space is the set of all possible configurations of rings on the pegs. Some
of the configurations or states in the space are given special
interpretations:
Towers of Hanoi
Initial state
Goal State
Move the disks from the leftmost post to the rightmost

post while never putting a larger disk on top of a
smaller one
move one disk at a time, from one peg to

another;
Middle post can be used for intermediate
storage.
6.Tic-Tac-Toe as a State Space
SJCET Page 21
Real World Problems
1. Route finding problem
Route finding problem is defined in terms of specified locations and

transitions along links between them. Route finding algorithms are used
in a variety of applications such as routing in computer networks,
military operations planning and airline travel planning system. These
problems are typically complex to explain.
2. Traveling salesman problem
This is also a Route finding problem. A salesperson has to visit a

number of cities. (S)He can start at any city and must finish at that same
city. The salesperson must visit each city only once. A simple control
structure could in principle solve the problem. It would simply explore all
possible paths in the tree and return the one with the shortest length.
This approach will work for very short list of cities. But it breaks down
quickly as the no of cities grows.
SJCET Page 22
If there are n cities then the number of possible paths among them
is 1*2*3*4*(n-1) or (n-1)! .The time required to examine a single
path is proportional to n!. Assume there are 35 cities to visit. To solve
this problem he would take more time than he would be willing to send.
This phenomenon is called combinatorial explosion.
We can beat this using a simple strategy called Branch and

bound. Begin generating complete paths keeping track of the shortest
path found so far. Give up exploring any path as soon as its partial
length becomes greater than the shortest path found so far. Using this
technique we are still guaranteed to find the shortest path. Although this
algorithm is efficient than the first one it still requires exponential time.
3. VLSI layout
A VLSI layout problem requires positioning millions of components

and connections on a chip to minimize area, minimize circuit delay and
maximize manufacturing yield. The layout problem comes after the
logical design phase and is usually split into 2 parts : cell layout and
channel routing. The aim is to place the cells on the chip so that they do
not overlap and so that there is room for the connecting wires to be
placed between the cells. Channel routing finds a specific route for each
wire through the gaps between the cells.
4. Robot Navigation
It is a generalization of route problem. Rather than a discrete set of

routes, a robot can move in a continuous space with an infinite set of
possible actions and states. When robot has arms and legs or wheel that
must also be controlled, the search space becomes multi-dimensional.
5. Automatic assembly sequencing
The aim is to find an order in which to assemble the parts of some

object .If the wrong order is chosen there will be no way to add some part
later in the sequence without undoing some of the work already done.
6. Protein Design
The goal is to find a sequence of amino acids that will fold in to

three dimensional protein.
SJCET Page 23
7. Internet Searching
Looking for answers to questions for related information.
SOLVING PROBLEMS BY SEARCHING

Well defined problems and solutions.
A Problem can be defined by four components
The initial state that the agent starts in.Eg In(Arad) in traveling
problem.
The description of the possible actions available to the agent.
Successor function: Given a particular state x, successor-FN (x) returns a
set of < action, successor> ordered pairs, where each action is one of the
legal action in state x and each successor is a state that can be reached
from x by applying the action.
Eg:
{<Go(sibiu),In(sibiu)>,<Go(timisora),In(Timisora)>,<Go(zerint),In(zerint)>}
Together the initial state and successor function defines the state space.
A path in the state space is a sequence of state connected by sequence
of action.
The Goal Test
It determines whether the given state is goal or not Eg: { In(Bucharest)}
SJCET Page 24
A Path Cost
This function assigns a numeric cost to each path. The step cost of
taking action a to go from state x to state y is denoted by c(x,a,y).
A solution is a path from the initial state to goal state. An optimal

solution has the lowest path cost among all solutions.
FORMULATING PROBLEMS
Abstraction: the process of removing details from representation Eg: in
an actual cross country trip it includes many details like traveling
companions, what is on the radio, the scenery out of the window,
weather, and condition of the road. These things are irrelevant to the
problem for finding solution.
Action Abstraction: in addition to abstracting state description we can
abstract actions also. A driving action has many effects. Besides
changing the location of the vehicle, it takes up time, consumes fuel,
generates pollution etc. In our formulation we take into account only the
change in location. In a problem solving scenario think of the abstract
state and action to be chosen corresponding to large set of detailed world
states and detailed action sequence. The choice of a good abstraction
thus involves removing as much details as possible.
Searching for Solutions
Solution can be found out by searching in state space. We can

generate a search tree that is generated by the initial state and the
successor function that together define the state space. The root of
search tree is a search node corresponding to the initial state. The first
step is to find whether it is a goal state. If it is not we need to consider
other states. This is done by expanding the current state ie applying the
successor function to the current state thereby generating a new set of
states.
We continue choosing, testing and expanding until either a

solution is found or there are no more states to be expanded. The choice
of which state to expand is determined by search strategy. For e.g. if
there are 20 states in state space, one for each city. But there are infinite
no of paths in this state space so search tree has infinite no of nodes.
SJCET Page 25
Nodes are usually represented by a data structure with 5

components as:
1. State the state in the state space to which the node corresponds
2. Parent node node in the search tree that generated this node
3. Action action that was applied to the parent to generate the node.
4. Path cost cost of the path from the initial state to the node as
indicated by parent pointers
5. Depth no of steps along the path from the initial state.
Collection of nodes that have been generated but not yet expanded
is called fringe. Each element of the fringe is a leaf node i.e. a node with
no successors in the tree.
MEASURING PROBLEM-SOLVING PERFORMANCE

(*)
Problem-solving performance is measured in four ways:
1. Completeness - Does it always find a solution if one exists?

2. Optimality - Does it always find the least-cost solution?
3. Time Complexity - How long does it take to find a solution? (Number
of nodes generated/expanded)
4. Space Complexity - Number of nodes stored in memory during
search?
Time and space complexity are measured in terms of problem difficulty

defined by:
b - Maximum branching factor of the search tree

d - Depth of the least-cost solution
m - Maximum depth of the state space (may be infinity)
Time is often measured in terms of no of nodes generated during

search and space in terms of max no of nodes stored in memory.
SJCET Page 26
PRODUCTION SYSTEMS (*)
A production system (or production rule system) is a computer

program typically used to provide some form of artificial intelligence,
which consists primarily of a set of rules about behavior. These rules,
termed productions, are a basic representation found useful in AI
planning, expert systems and action selection. A production system
provides the mechanism necessary to execute productions in order to
achieve some goal for the system.
Production system consist of
A set of rules : Productions consist of two parts: a sensory precondition

(or "IF" statement) and an action (or "THEN"). If a production's
precondition matches the current state of the world, then the production
is said to be triggered. If a production's action is executed, it is said to
have fired.
One or more knowledge databases - which maintains data about current

state or knowledge,
Control Strategies and Rule Applier- that specifies the order in which the
rules will be compared to the database and ways in which conflicts are
resolved. This is also known as a rule interpreter, which performs
SJCET Page 27
1- PATTERN MATCHING STAGE

The rules of a production consist of a condition and action in the
form: (if x then y). The left-hand-side conditions are compared
against the elements of working memory to determine if the
conditions are satisfied.
preconditions match content of

of a rule <=====> the working memory.
when match is found => rule is applicable
2.CONFLICT RESOLUTION STAGE (SELECTION STRATEGY )

At any point in processing, several productions may match to the
elements of working memory simultaneously. Since production systems
are normally implemented on serial computers, this result in a conflict:
there is a non-unique choice about which action to take next. Most
conflict resolution schemes are very simple, dependent on the number of
conditions in the production, the time stamps (ages) of the elements to
which the conditions matched, or completely random. One of the
advantages of production systems is that the computational complexity
of the matcher, while large, is deterministically finite.
3.ACTION STAGE
RB actions are
ADD - To add facts to working memory
MODIFY - To modify facts in working memory
REMOVE To remove facts from working memory
Monotonic Production System is a production system in which

application of a rule never prevents the later application of another rule
that could also have been applied, at the same time when the first rule
was selected.
A Non-Monotonic System wont allow this.
SJCET Page 28
Classes of Production systems:

Monotonic Production System: the application of a rule never
prevents the later application of another rule that could also
have been applied at the time the first rule was selected.
Non-Monotonic Production system :-In non-monotonic
system, the above rule is not applicable.
Partially commutative Production system: property that if
application of a particular sequence of rules transforms
state x to state y, then permutation of those rules allowable,
also transforms state x into state y.
Commutative Production system-Production system that is
both monotonic and partially commutative.
CONTROL STRATEGIES (*)

Control strategies are useful to decide which rule to apply next during
the process of searching for a solution to a problem.
The requirements of a good control strategy are as follows:
The first requirement of a good control strategy is that it causes
motion .If for the water jug problem, if we have implemented the
simple control strategy of starting each time at the top of the list of
rules and choosing the first applicable ones, we would never solve
the problem. Control Strategies that do not cause motion will never
lead to a solution.
The second requirement of a good control strategy is that it must

be systematic.
SJCET Page 29
We can now draw a part of a search space by showing the initial state at
the top of an upside-down tree, with each "level" consisting of states that
result from applying operators to states in the level above:
Problem solving agents decide what to do by finding sequences of actions

that lead to desirable states.
Different Control Strategies include BFS,DFS.
PROBLEM CHARACTERISTICS
In order to choose an appropriate method for a particular problem it is

necessary to analyze the problem along several key dimensions as:
Is the problem decomposable?
Can solution steps be ignored or undone?
Is the universe predictable?
Is a good solution absolute or relative?
Is the solution a state or a path?
What is the role of knowledge?
Does the task require human-interaction?
SJCET Page 30
1. Is the problem decomposable?
Suppose we want to solve the problem of computing the

expression:
(x2 + 3x + sin2x.cos2x)dx
We can solve this problem by breaking down it into 3 smaller

problems each of which we can be solved independently.
Decomposable problem can be solved easily. This can be solved by a
simple integration program that works as follows. At each step it
checks to see whether the problem it is working on is immediately
solvable. If so then the answer is returned directly. If the problem is
not easily solvable, the integrator checks to see whether it can
decompose the problem into smaller problems. If it can it creates
those problems and calls itself recursively on them. The problem tree
is shown below:
(x2 + 3x + sin2x.cos2x)dx
x2dx 3xdx sin2x.cos2xdx
(1 cos2x)cos2xdx
cos2xdx cos4xdx
29
2. Can solution steps be ignored or undone?

Here problems are divided into 3 classes. Ignorable, in which
solution steps can be ignored. Recoverable, in which solution steps
can be undone. Irrecoverable, in which solution steps cannot be
undone.
Problem Classification
1) Ignorable problems ( eg. Theorem proving)

Here solution steps can be ignored. When we try to prove a
mathematical theorem, we proceed by first proving a lemma that we
think will be useful. Eventually we realize that the lemma is no help
at all. Here the different steps in proving the theorem can be ignored.
Then we can start from another rule. The former can be
SJCET Page 31
ignored.Ignorable problems can be solved using a simple control

structure that never backtracks. Such a control structure is easy to
implement.
2) Recoverable problems s (eg. 8 puzzle problem)
The goal is to transform the starting position into the goal position by
sliding the tiles around. In an attempt to solve the 8- puzzle, we might
make a stupid move. For example, in the game shown above, we
might start by sliding tile 5 into the empty space. Having done that,
we cannot change our mind and immediately slide tile 6 into the
empty space since the empty space will essentially have moved. But
we can backtrack and undo the 1st move, sliding tile 5 back to where
it was. Then we can move tile 6. Here mistakes can be
recovered.Backtracking will be necessary to recover from such
mistakes, so the control structure must be implemented using a
pushdown stack in which decisions are recorded in case they need to
be undone.
3) Irrecoverable problems (eg. Chess)

- in which moves cannot be retracted. Eg : Playing Chess. They will
need to be solved by a system that expends a great deal of effort making
each decision since the decision must be final. Irrecoverable problems
can be solved by recoverable style methods via planning.
3. Is the universe predictable?
Certain outcome problems (eg. 8 puzzle)

Consider playing with the 8 puzzle problem. Every time a move is
made, we know exactly what will happen. This means that it is possible
SJCET Page 32
to plan an entire sequence of moves and be confident that we know what

the resulting state will be. For certain-outcome problems, planning can
used to generate a sequence of operators that is guaranteed to lead to a
solution.
Uncertain outcome problems (eg. Bridge)

In Bridge we cannot know exactly where all the cards are or what
the other players will do on their turns. What we would like to do is to
plan the entire hand before making the first play. These problems are
called uncertain outcome problems. For uncertain-outcome problems,
a sequence of generated operators can only have a good probability of
leading to a solution.
Plan revision is made as the plan is carried out and the necessary
feedback is provided.
One of the hardest types of problems to solve is the irrecoverable,

uncertain outcome. Examples of such problems are Playing bridge,
Controlling a robot arm, Helping a lawyer decide how to defend his client
against a murder charge
4. Is a good solution absolute or relative?
Any-path problems can be solved in a reasonable amount of time

using heuristics that suggest good paths to explore. If the heuristics are
not perfect the search for the solution may not be as directly as possible.
Consider the problem of answering questions based on a database
of simple facts, such as the following.
1. Marcus was a man.
2. Marcus was a Pompean.
3. Marcus was born in 40 A. D.
4. all men are mortal.
5. All pompeans died when the volcano erupted in 79 A. D
. 6. No mortal lives longer than 150 years.
7. It is now 1991 A. D.
Suppose we ask the question. Is Marcus alive?. By representing
each of these facts in a formal language, such as predicate logic, and
SJCET Page 33
then using formal inference methods, we can fairly easily derive an

answer to the question.
The following shows 2 ways of deciding that Marcus is dead.
Best path problems (eg. Traveling salesman problem )

Consider the traveling salesman problem. Our goal is to find the
shortest route that visits each city exactly once. Let the cities to be
visited and the distances between them are shown below.
One place the salesman could start is Boston. In that case, one
path that might be followed is the one shown below which is 8850 miles
long.
SJCET Page 34
But is this the solution to the problem? The answer is that we cannot be
sure unless we also try all other paths to make sure that none of them is
shorter. Best path problems are computationally harder than any path
problems.
5. Is the solution a state or a path?
Problems whose solution is a state of the world. eg. Natural

language understanding
Consider the problem of finding a consistent interpretation for the
sentence, The bank president ate a dish of pasta salad with the fork.
There are several components of this sentence, each of which, in
isolation, may have more than one interpretation. Some of the sources of
ambiguity in this sentence are the following. The word bank may refer
either to a financial institution or to a side of a river. The word dish is
the object of the verb eat. It is possible that a dish was eaten. But it is
more likely that the pasta salad in the dish was eaten. Pasta salad is a
salad containing pasta. But there are other ways interpretations can be
formed from pairs of nouns. For example, dog food does not normally
contain dogs. The phrase with the fork could modify several parts of the
sentence. In this case, it modifies the verb eat. But, if the phrase had
been with vegetables, then the modification structure would be different.
SJCET Page 35
Because of the interaction among the interpretations of the

constituents of this sentence, some search may be required to find a
complete interpretation for the sentence. But to solve the problem of
finding the interpretation, we need to produce only the interpretation
itself. No record of the processing by which the interpretation was found
is necessary.
Problems whose solution is a path to a state? Eg. Water jug
problem
In water jug problem, it is not sufficient to report that we have
solved the problem and that the final state is (2,0). For this kind of
problem, what we really must report is not the final state, but the path
that we found to that state
6. What is the role of knowledge?
Problems for which a lot of knowledge is important only to constrain the

search for a solution. Eg. Chess
Consider the problem of playing chess. How much knowledge would be
required by a perfect chess playing program? Just the rules for
determining the legal moves and some simple control mechanism that
implements an appropriate search procedure.
Problems for which a lot of knowledge is required even to be able to
recognize a solution. Eg. News paper story understanding
Consider the problem of scanning daily newspapers to decide which are
supporting democrats and which are supporting the republicans in some
upcoming election. How much knowledge would be required by a
computer trying to solve this problem? Here a great deal of knowledge is
necessary.
7. Does the task require human-interaction?
Based on human interaction problems can be classified as:
Solitary problem, in which computer is given a problem

description and produces an answer with no intermediate
communication and no demand for an explanation of the reasoning
process.
Conversational problem, in which there is intermediate

communication between a person and a computer either to provide
SJCET Page 36
additional assistance to the computer or to provide additional

information to the user or both.
eg to prove some new, very difficult theorem. Then the program

may not know where to start. At the moment, people are still better
at doing the high level strategy required for a proof. So the
computer might like to be able to ask for advice. To exploit such
advice, the computers reasoning must be analogous to that of its
human advisor, at least on a few levels.
SEARCH ALGORITHMS
Search algorithms classified as
1. Uninformed Search/Blind Search - in the sense that they are

given no information about the problem other than its problem
definition.
2. Informed Search/Heuristic Search ones that have some idea of

where to look for solutions.
Search Strategies
1. Exhaustive (uninformed) search
Breath-first search
Uniform-cost search
Depth-first search
Depth-limited search
Iterative deepening search
Bidirectional search
2. Heuristic (informed) search
Hill climbing
Simulated annealing
Best-first search
A* search
UNINFORMED/BLIND SEARCH
1. Breadth First Search
It is a simple strategy in which root node is expanded first then all

successors of root node are expanded next and then their successors and
so on. Consider again the search space shown.
SJCET Page 37
Let us suppose that the state labeled G is a goal state in this space, and
that, as shown, no operators apply to the states I, J, E, F and H.
A program will start with the initial state A, and try to find the goal
by applying operators to that state, and then to the states B and/or C
that result, and so forth. The idea is to find a goal state, and often one is
also interested in finding the goal state as fast as possible, or in finding a
solution that requires the minimum number of steps, or satisfies some
other requirements.
One approach to deciding which states that operators will be

applied to is called "Breadth-First Search". In a breadth-first search, all
of the states at one level of the tree are considered before any of the
states at the next lower level. So for the simple search state pictured
above, the states would be applied in the order as indicated below:
Algorithm: Note:
1. Create a variable called NODE-LIST and set it to initial state.

2. Until a goal is found or NODE-LIST is non-empty,
1. Remove the first element from NODE-LIST and call it E. If
NODE-LIST was empty, quit.
2. For each way that each rule can match the state described in
E do
a) Apply the rule to generate a new state.
b) If the new state is a goal state, terminate with success
and return that state.
c) Otherwise add the new state to the end of NODE-LIST
Usually BFS is implemented using data structure called queue.

You add the newly formed paths to the back of the list. When you remove
them to expand them, you remove them from the front.
Completeness: Does it always find a solution if one exists? YES, if

shallowest goal node is at some finite depth d
Time complexity: Assume a state space where every state has b

successors. Root node has b successors, each node at the next level has
SJCET Page 38
again b successors (total b2), and so on. Assume solution is at depth d.

In Worst case we would expand all but the last node at depth d since the
goal itself is not expanded generating bd+1 b nodes at level d+1.Then
total number of nodes generated is
b+b2 +b3 +...+ bd + (bd+1 -b) =O (bd+1)
Space complexity: If each node is retained in memory space complexity

will be same as that of time complexity i.e. O (bd+1)
Optimality: Yes unless actions have different cost.
Advantages:
1. BFS will not get trapped anywhere .This contrasts with DFS which
may follow a single unfruitful path for a very long time before the
path actually terminates in a state that has no successors.
2. If there is solution then BFS is guaranteed to find it. Furthermore
if there are multiple solutions then a minimal solution will be
found. This is guaranteed by the fact that longer paths are never
explored until all shorter ones have already been examined. This
contrasts with DFS which may find a long path to a solution in one
part of the tree when a shorter path exists in some other
unexplored part of the tree.
Disadvantages:
1. High storage requirement: exponential with tree depth.
2. Uniform Cost Search
Uniform-cost search is similar to breadth-first search. BFS is

optimal when all the step costs are equal, because it always expands the
shallowest unexpanded node. By a simple extension we can find an
algorithm that is optimal with any step cost function. Instead of
expanding the shallowest node UCS expands the node with lowest path
cost. UCS is the same as BFS when all step-costs are equal. This is
implemented by means of a queue ordered by path cost.
We associate with each node n a cost g(n) that measures the cost of
getting to node n from the start node. g(start) = 0. If ni is a successor of n,
then g(ni) = g(n) + c(n,ni) , where c(n,ni) is the cost of going from node n to
node ni .
SJCET Page 39
Completeness: YES, if step-cost > (small positive constant)
Time complexity: Assume C* the cost of the optimal solution. Assume

that every action costs at least . In the Worst-case time complexity will
be O (b C*/ )
Space complexity: Same as that of time complexity
Optimality: It will be optimal since nodes expanded in order of

increasing path cost. (Also if complete)
Advantage:
1. Guaranteed to find the least-cost solution.
Disadvantages:
1. Exponential storage required.

2. open list must be kept sorted (as a priority queue).
3. Must change cost of a node on open if a lower-cost path to it is
found.
Uniform-cost search is the same as Heuristic Search when no

heuristic information is available (heuristic function h is always 0).
3. Depth First Search
DFS is another control strategy which always expands the deepest

node. We could pursue a single branch of the tree until it yields a
solution or until a decision to terminate the path is made. In depth-first
search, the search is conducted from the start state as far as it can be
carried until either a dead-end or the goal is reached. If a dead-end is
reached, backtracking occurs.
The most recently created state from which alternative moves are
available will be revisited and a new state is created. This form of
backtracking is called chronological backtracking because the order in
which steps are undone depends only on the temporal sequence in which
steps where originally made. Specifically the most recent step is always
the first to be undone. This form of backtracking is what is usually
meant by the simple backtracking. An example is shown below:
SJCET Page 40
In a depth-first search, after operators are applied to a state, one of

the resultant states is considered next. So the order in which the states
of the simple example space will be considered is:
Algorithm:
1. If the initial state is a goal state, terminate with success and return
that state.
2. Otherwise do the following until success or failure is signaled,
a) Generate a successor E of the initial state. If there are no more

successors signal failure.
b) Call DFS with E as initial state.
c) If success is returned signal success otherwise continue in this
loop
Usually DFS is implemented using a stack.(LIFO). In a stack, new

elements are added to the front of the list rather than the back, but when
SJCET Page 41
the remove the paths to expand them, you still remove them from the
front. The result of this is that DFS explores one path, ignoring
alternatives, until it either finds the goal or it cant go anywhere else.
Completeness: Does it always find a solution if one exists? NO, unless

search space is finite and no loops are possible.
Time complexity: O(bm ) .Terrible if m is much larger than d (depth of

optimal solution). But if many solutions are present, then faster than BF-
search
Space complexity: O(bm) .Backtracking search uses even less memory.

In that it generates only one successor instead of all
Optimality: No, unless search space is finite and no loops are possible.
Advantages:
1. DFS requires less memory since only the nodes on the current
path are stored. This contrasts with BFS where all of the tree that
has so far been generated must be stored. Once a node has been
expanded it can be removed from memory as soon as all its
descendants have been fully explored.
2. Easily programmed: function call stack does most of the work of
maintaining state of the search.
3. DFS may find a solution without examining much of the search
space at all. This contrasts with BFS in which all parts of the tree
must be examined to level n before any nodes at level n+1 can be
examined. This is particularly significant if many acceptable
solutions exist. DFS can stop when one of them is found.
Disadvantages:
1. May find a sub-optimal solution (one that is deeper or more costly

than the best solution).
2. Incomplete: without a depth bound, may not find a solution even if
one exists.
SJCET Page 42
A variant of DFS called backtracking search uses still lesser memory.

In backtracking only one successor is generated at a time rather than all
successors. Each partially expanded node remembers which successor to
generate next. In this way only O(m) memory is needed rather than
O(bm) where b is the branching factor and m is the maximum depth.
4. Depth Limited Search
Depth-first search can spend much time (perhaps infinite time)

exploring a very deep path that does not contain a solution, when a
shallow solution exists. An easy way to solve this problem is to put a
maximum depth limit l on the search ie nodes at depth limit are
treated as if they have no successors. Beyond the depth limit, a failure is
generated automatically without exploring any deeper. This approach is
called depth limited search. The depth limit solves the infinite path
problem.
Unfortunately it also introduces an additional source of

incompleteness if we choose l <d ie shallowest goal is beyond the depth
limit(if d is known).Depth limited search will not be optimal if we choose l
>d. DFS can be viewed as a special case of Depth limited search with l=.
If a solution exists at depth d or less, then d -limited DFS will find

the solution, and the algorithm is very efficient in space. However, depth-
limited DFS is not complete: If a solution exists but only at depth greater
than d, then depth-limited DFS will not find the solution.
For eg : in the case of a TSP consider a map with 20 cities.

Therefore we know that if there is a solution it must be of length 19 at
the longest so l =19 is a possible choice. But if we study the map
carefully we can see that any city can be reached from any other city in
at most 9 steps .This is known as diameter of state space gives us a
better depth limit which leads to a more efficient depth limited search.
Depth limited search can terminate with 2 kinds of failure
1. standard failure indicates no solution

2. no solution within the depth limit
SJCET Page 43
Algorithm :
1. Determine the vertex where the search should start and assign the
maximum search depth
2. Check if the current vertex is within the maximum search depth
o If not: Do nothing
o If yes:
1. Expand the vertex and save all of its successors in a
stack
2. Call DLS recursively for all vertices of the stack and go
back to Step 2
Completeness : In general the algorithm is not complete since it does

not find any solution that lies beyond the given search depth. But if you
choose the maximum search depth to be greater than the depth of a
solution the algorithm becomes complete.
Time complexity: O(bl ) where l is the depth limit
Space complexity: O(bl) where l is the depth limit
Optimality: Depth-limited search is not optimal. It still has the problem

of depth-first search that it first explores one path to its end, thereby
possibly finding a solution that is more expensive than some solution in
another path.
Problems:
1. It's hard to guess how deep the solution lies.

2. If the estimated depth is too deep (even by 1) the computer time
used is dramatically increased, by a factor of bextra.
3. If the estimated depth is too shallow, the search fails to find a
solution; all that computer time is wasted.
5. Depth First Iterative Deepening
Iterative deepening depth-first search or IDDFS is a state space

search strategy in which a depth-limited search is run repeatedly,
increasing the depth limit with each iteration until it reaches d, the
depth of the shallowest goal state. On each iteration, the IDDFS visits the
nodes in the search tree in the same order as depth-first search, but the
cumulative order in which nodes are first visited, is effectively breadth-
first.
SJCET Page 44
Iterative deepening depth-first search combines depth-first

search's space-efficiency and both breadth-first search's completeness
(when the branching factor is finite) and optimality (when the path cost is
a non-decreasing function of the depth of the node).Since iterative
deepening visits states multiple times it may seem wasteful, but it turns
out to be not so costly, since in a tree most of the nodes are in the
bottom level, so it does not matter much if the upper levels are visited
multiple times.
The main advantage of this algorithm in game tree searching is

that the earlier searches tend to improve the commonly used heuristics,
such as the killer heuristic and alpha-beta pruning, so that a more
accurate estimate of the score of various nodes at the final depth search
can occur, and the search completes more quickly since it is done in a
better order (it can be shown that alpha-beta pruning works much better
if the moves are generated with the moves likely to be the best moves
evaluated first). An eg : is shown below:
In an iterative deepening search, the nodes on the bottom level are

expanded once, those on the next to bottom level are expanded twice,
and so on, up to the root of the search tree, which is expanded d + 1
times. So the total number of expansions in an iterative deepening
search is
N(IDS)=(d + 1)1 + (d)b + (d- 1)b2 + + 3bd 2 + 2bd 1 + bd
Node generation:
SJCET Page 45
level d: once
level d-1: 2
level d-2: 3
.
level 2: d-1
level 1: d
N(BFS)= b+b2 +b3 +...+ bd + (bd+1 -b)
In general, iterative deepening is the preferred search method

when there is a large search space and the depth of the solution is not
known. Iterative deepening essentially throws away the results of every
depth-limited search before going on to the next. This means that
iterative deepening simulates breadth-first search, but with only linear
space complexity.
Similar to iterative deepening is a search strategy called iterative

lengthening search that works with increasing path-cost limits instead
of depth-limits. It turns out however, that iterative lengthening incurs
substantial overhead that make it less useful than iterative deepening as
a search strategy.
Algorithm :
1. Set DEPTH-LIMIT = 0
2. Conduct depth-first search to a depth of DEPTH-LIMIT If a solution
path is found, then return it.
3. Increment DEPTH-LIMIT by 1 and go to step 2.
Completeness: YES (no infinite paths)
Time Complexity: Asymptotically approaches O(bd) . Algorithm seems

costly due to repeated generation of certain states.
Space Complexity: O(bd)
Optimality: YES if step cost is 1.
Advantages:
1. Finds an optimal solution (shortest number of steps).

2. Has the low (linear in depth) storage requirement of depth-first
search.
Disadvantage:
SJCET Page 46
1. Some computer time is wasted re-exploring the higher parts of the

search tree. However, this actually is not a very high cost.
6. Bi-Directional Search
Bidirectional search is a graph search algorithm that runs two

simultaneous searches: one forward from the initial state and one
backward from the goal and stopping when the two meet in the middle. It
requires explicit goal state rather than a goal criterion. The reason for
this approach is that each of the two searches has complexity O(bd / 2) (in
Big O notation), and O(bd / 2 + bd / 2) is much less than the running time
of one search from the beginning to the goal, which would be O(bd).
ie, bd/2 + bd/2 bd
This does not come without a price: Aside from the complexity of
searching two times in parallel, we have to decide which search tree to
extend at each step; we have to be able to travel backwards from goal to
initial state - which may not be possible without extra work; and we need
an efficient way to find the intersection of the two search trees. This
additional complexity means that the A* search algorithm is often a
better choice if we have a reasonable heuristic.
It is implemented by having one or both of the searches check each

node before it is expanded to see if it is in the fringe of the other search
tree. At least one of the search tree needs to be kept in memory so that
membership check can be done hence the space complexity is also O(bd /
2).This space requirement is the most significant weakness of
bidirectional search. The algorithm is complete and optimal if both
searches are BF.
Completeness: Yes
Time Complexity: O(bd/2) like breadth first but to half depth
SJCET Page 47
Space Complexity: O(bd/2) need to retain at least that many nodes to

guarantee completeness
Optimal: Yes if step cost is 1
INFORMED SEARCH/HEURISTIC SEARCH
Informed Search/Heuristic Search ones that have some idea of

where to look for solutions. Strategies that know whether one non
goal state is more promising than another are called informed
search or heuristic search strategies.
A heuristic is a method that might not always find the best

solution but is guaranteed to find a good solution in reasonable
time.
Heuristic search is useful in solving tough problems which could
not be solved any other way and where solutions take an infinite
time or very long time to compute.
Example of heuristic search methods is the travelling salesman

problem.
Exploration is one of the techniques that is used for information
gathering in informed search.
Heuristic function:
The heuristic function is the one, which is used to decide which

node is the best in the search tree to expand next. The heuristic
function is specific to the problem under consideration.
The heuristic function or the evaluation function is denoted by f.
The heuristic function or the evaluation function decides the next
move to be made in the search space. The convention used could
be a smaller value of the evaluation function leads earlier to the
goal state. The next node to be expanded in the search tree will be
the one having lowest f value.
Some of the examples of informed search strategies are as follows
SJCET Page 48
GENERATE AND TEST

Generate and test is acceptable for simple problems whereas it is
inefficient for problems with large space. This is so because
complete solutions must be created before testing is done.
Generate-and-test search algorithm is a very simple algorithm that
guarantees to find a solution if done systematically and there
exists a solution.
Algorithm Generate and Test:
Generate a possible solution. For some problems, this means
generating a particular point in the problem space. For others, it
means generating a path from a start state.
2. Test to see if this is the expected solution by comparing the
chosen point or the endpoint of the chosen path to the set of
acceptable goal states.
3. If the solution has been found quit else go to step 1.
SJCET Page 49
The most straightforward way to implement systematic generate and test

is a depth-first search tree with backtracking. Other strategies of
generate and test are as follows:
Exhaustive generate-and-test.
Heuristic generate-and-test: not consider paths that seem unlikely
to lead to a solution.
Plan generate-test: Here planning process uses constraint
satisfaction techniques and create a list of candidates. Apply
generate-and-test to that list.
Example :Color Blocks Problem
HILL CLIMBING
Hill climbing is a variant of generate and test in which the feedback

from the test procedure is used to help the generator decide which
direction to move in the search space.
The key difference between Generate and Test and Hill climbing is
the use of an evaluation function as a way to inject task-specific
knowledge into the control process.
APPLICATION OF HILL CLIMBING IN 8 QUEENS

PROBLEM
8-queens problem, complete-state formulation

All 8 queens on the board in some configuration
SJCET Page 50
Successor function:
It is function which returns all possible states which are generated
by a single queen move to another in the same column. The total
successor of the each state 8x7 =56.
Heuristic function h(n):

the number of pairs of queens that are attacking each other
(directly or indirectly)
(so we want to minimize this)
The value zero for the global minimum of the function which
occurs only at perfect solutions.
Current state: h=17

Shown is the h-value for each
possible successor in each column
A local minimum in the 8-queens state space (h=1)
SJCET Page 51
DISADVANTAGES OF HILL CLIMBING ALGORITHM
A local maximum -a state that is better than all its neighbours

but is not better than some other states farther away.
A plateau - a flat area of the search space in which a whole set of

neighbouring states have the same value. On a plateau, it is not
possible to determine the best direction in which to move by
making local comparisons.
SJCET Page 52
A ridge - a special kind of local maximum. A ridge is a special kind

of local maximum. It is an area of the search space that is higher
than surrounding areas and that itself has a slope.
The orientation of the high region, compared to the set of available

moves, makes it impossible to climb up. However, two moves
executed serially may increase the height.
There are some ways of dealing with these problems.

Backtrack to some earlier node and try going in a different
direction. This is a fairly good way of dealing with local maxima.
Make a big jump in some direction to try to get to a new section of
the search space. This is a good way of dealing with plateaus.
Apply 2 or more rules before doing the test. This corresponds to
moving in several directions at once. This is a good way for dealing
with ridges.
STEEPEST ASCENT HILL CLIMBING
SJCET Page 53
BLOCK WORLD PROBLEM EXAMPLE
Start
Goal
Local heuristic:
+1 for each block that is resting on the thing it is supposed to be
resting on.
-1 for each block that is resting on a wrong thing.
Using this function, the goal state has a score of 8. The initial slate has a
score of 4 (since it gets one point added for blocks C, D, E, F, G and H
and one point subtracted for blocks A and B).
There is only one move from the initial state namely to move block A to
the table. That produces a state with a score of 6 (since now As position
causes a point to be added rather than subtracted).
The hill-climbing procedure will accept that move.
SJCET Page 54
From the new state, there are three possible moves, leading A to the
three stales shown in Fig. These states have the scores:
(a) 4. (b) 4. And (c) 4.

Hill climbing will halt because all these states have lower scores than
the current state. The process has reached a local maximum that is not
the global maximum.
SJCET Page 55
Global heuristic:
For each block that has the correct support structure: +1 to every
block in the support structure.
For each block that has a wrong support structure: -1 to every block
in the support structure.
SJCET Page 56
Using this function, the goal state has a score of 28.(1 for B,2 for
C.) The initial slate has a score of -28 (since it gets one point
subtracted for block C, 2 for D)
Moving block A to the table produces a state with a score of -21

(since A no longer has seven blocks under it).
The three states that can be produced next have the following
scores
a)-28 b)-16 and c) -15.

This time steepest ascent hill climbing will choose c) which is the
correct one.
SJCET Page 57
a)score -28
b)score -16
c)score -15
SIMULATED ANNEALING
A variation of hill climbing in which, at the beginning of the
process, some downhill moves may be made.
To do enough exploration of the whole space early on, so that the
final solution is relatively insensitive to the starting state.
Thus lowering the chances of getting caught at a local maximum,
or plateau, or a ridge.
Physical substances are melted and then gradually cooled until
some solid state is reached. The goal is to produce a minimal-
energy state.
Here we attempt to minimize rather than maximising the value of
the objective function.
The process is one of valley descending in which the objective
function is the energy level.
Nevertheless, there is some probability for a transition to a higher
energy state: p=e-E/kT.
Where E is the positive change in the energy level is the temperature

and k is the Boltzmanns constant.
SJCET Page 58
Physical annealing has some properties. .

If cooling occurs so rapidly, stable regions of high energy will form.
If however, a slower schedule is used, a uniform crystalline
structure which corresponds to a global minimum is more likely to
develop.
If the schedule is too slow, time is wasted. These properties of
physical annealing can be used to define the process of simulated
annealing. In this process, E represents change in the value of
heuristic evaluation function instead of change in energy level. k
can be integrated in to T. hence we use the revised probability
formula P = e-E / T ,
The algorithm differs from simple hill climbing in the following

aspects
The annealing schedule must be maintained,
Moves to worse states may be accepted.
It is a good idea to maintain, in addition to the current state, the

best state found so far. Then, if the final state is worse than that
earlier state the earlier state is still available.
ALGORITHM-SIMULATED ANNEALING
SJCET Page 59
To implement this algorithm, it is necessary to maintain an

annealing schedule.
That is first we must decide the initial value to be used for
temperature. The second criterion is to decide when the
temperature of the system should be reduced.
The third is the amount by which the temperature will be reduced
each time it is changed.
In this algorithm, instead of picking the best move, it picks a
random move. If the move improves the situation, it is always
accepted. Otherwise the algorithm accepts the move with some
probability less than 1.
The probability decreases exponentially with the amount E by
which the evaluation is worsened. The probability also decreases
as the temperature T goes down.

Thus bad moves are more likely to be allowed at the start when the
temperature is high, and they become more unlikely as T
decreases. Simulated annealing was first used extensively to solve
VLSI layout problems.
SJCET Page 60
SJCET Page 61

Artificial Intelligence AI Basics

Uploaded by

Document Informationclick to expand document information

Copyright:

Available Formats

Artificial Intelligence AI Basics

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Artificial Intelligence AI Basics

Uploaded by

Copyright:

Available Formats

Module-1 Artificial Intelligence

Artificial Intelligence is the branch of computer science

Systems that think like humans Systems that think rationally

Systems that act like humans Systems that act rationally

Acting humanly: The Turing Test approach

The computer passes the test if a human interrogator, after posing

Natural language processing to enable it to communicate

Knowledge representation to store what it knows or hears

To pass the complete Turing Test, the computer will need

Computer vision to perceive the objects, and

Thinking humanly: The cognitive modeling approach

Thinking rationally : The laws of thought approach

Acting rationally : The rational agent approach

STRONG AI,SUPER INTELLIGENCE AND WEAK AI

Generally, artificial intelligence research aims to create AI that

Strong AI refers to a machine that approaches or

If it can do typically human tasks,

If it can apply a wide range of

If it has some degree of self-

Strong AI aims to build machines whose overall intellectual

o Weak AI refers to the use of software to study

o Example : a chess program such as Deep Blue.

o Weak AI does not achieve self-awareness; it

demonstrates wide range of human-level cognitive

IMPORTANCE OF AI IN MODERN ERA

AI currently encompasses a huge variety of subfields, ranging from

Main application areas are:

In the 1990s, computer speech recognition reached a practical

8. Understanding natural language

Just getting a sequence of words into a computer is not enough.

The world is composed of three-dimensional objects, but the inputs

10. Expert systems

Expert knowledge is a combination of theoretical understanding of the

11. Heuristic classification

12. Commonsense reasoning

It is the branch of Artificial intelligence concerned with replicating

common sense database, and is able to process and respond in plain-text

An agent is anything that can be viewed as perceiving its

The agent function maps any given percept sequence to

The agent function is an abstract mathematical description,

For example, in case of vacuum-cleaner world problem

Percept Sequence Action

PEAS: (Performance measure, Environment, Actuators,

Fully observable vs. partially observable: If an agent's sensors give it

Static vs. dynamic: The environment is unchanged while an agent is

Discrete vs. continuous: The discrete/continuous distinction can be

Agents with goals

Draw Backs of Table-driven agents

Table lookup of percept-action pairs defining all possible

No knowledge of non-perceptual parts of the current state

Take a long time to build the table

Goals help organize behavior by limiting the objectives that the

An agent first formulates a goal and a problem, searches for a sequence

The process of looking for such a sequence is called search. A

Once a solution is found the actions it recommends can be carried out,

This is called execution phase. Thus we have a simple formulate,

Usually the environment is assumed to be static because formulating