Artificial Intelligence
& Machine Learning
Search Strategies
Your Picture Here
Problem Solving
To build a system to solve a particular problem, we need to do four things
1.Define the problem precisely. Precise
specification of initial situation(s) and final
situations constitute acceptable solutions to the
problem.
2.Analyze the problem. A very few important
features can have an immense impact on
appropriateness of various possible techniques
for solving the problem.
3.Isolate and represent the task knowledge that
is necessary to solve the problem.
4.Choose the best problem solving technique(s)
and apply it to particular problem.
Production Systems: Systems that generate (produce) rules (states) to
reach a solution A production system commonly consists of following
four basic components:
1. A set of rules of the form Ci Ai where Ci refers to starting state and
Ai represents consequent state. Also Ci the condition part and Ai is the
action part.
2. One or more knowledge databases that contain whatever information
is relevant for the given problem.
3. A control strategy that ascertains the order in which the rules must be
applied to the available database
4. A rule applier which is the computational system that implements the
control strategy and applies the rules to reach to goal (if it is possible).
State Space
• A state space is the set of all possible configurations of a system. It is a
useful abstraction for reasoning about the behavior of a given system and
is widely used in the fields of artificial intelligence and game theory.
• In a tic-tac-toe game, every move by a player forms a state space and the
three similar (O or X) consecutive (row, column or diagonal) symbols forms
goal state.
• In a chess game also state space forms a set of moves by players.
Goal state
State Space search
• State space search is a process used in which successive or states of an
instance are considered, with the goal of finding a goal state with a desired
property.
• State space search often differs from traditional search (sequential, indexed
sequential, binary search etc) methods because the state space is implicit: the
typical state space graph is much too large to generate and store in memory.
Instead, nodes are generated as they are explored and typically discarded
thereafter.
One legal
chess move