Artificial Intelligence & Machine Learning: Search Strategies
Artificial Intelligence & Machine Learning: Search Strategies
Problem Solving
To build a system to solve a particular problem, we need to do four things
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.
3. A control strategy that ascertains the order in which the rules must be
applied to the available database
• 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.
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