Systematized: It should have some system or order to be followed. If water jug problem can be solved by picking random rules and repeating rules then that could have motion but again no order to be followed.
Breadth first search: Representing water jug problem starting with its initial state along with its off springs i.e. various possible solutions until for reaching a goal state.
It gives local as well as global motion.
Depth first search: One node of tree is explored until either dead end or goal state is not found.
In case of dead end chronological back tracking is done to explore various other ways to solve that problem. It also keeps current searching path in memory.
library school hospital factory park newsagent university church Explore nodes in tree order: library, school, hospital, factory, park, newsagent, uni, church. (conventionally explore left to right at each level)
Monotonic Repetition of rules is allowed Non-Monotonic No such Repetition is allowed Partially Commutative If x gives y then permutation of x also gives y Theorem Proving Robot Navigation Non Partially Commutative It is both monotonic and partial commutative Chemical Synthesis Bridge
Forward or Backward Reasoning i.e from Initial to goal state or vice versa.
Rule Matching: applying rule to initial state and moving on to the goal state.
Representation of knowledge can be in frame, fact or Script format.
Search Tree Search Graph 0,0 is appearing 2 times and it is one of our previous state so instead of repeating it we just linked it. It requires a small book-keeping which is called a graph. 0, 0 4, 0 0, 3 4, 3 0, 0 1, 3 4, 3 0, 0 3, 0 0, 0 4, 0 0, 3 4, 3 0, 0 1, 3 4, 3 0, 0 3, 0