{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture-4

Lecture-4 - Artificial Intelligence CS 165A 165A Friday...

This preview shows pages 1–10. Sign up to view the full content.

Artificial Intelligence CS 165A Friday, Jan 14, 2011 Basic Search (Ch 3) Basic Search (Ch. 3) 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Notes Lecture notes Username: cs165a Password: winter2011 Homework 1 due by Thursday 2 pm. 2
Review Problem formulation and search State-space description < {S}, S 0 , {S G }, {O}, {g} > S : Possible states S 0 : Initial state of the agent S : Goal state(s) G Or equivalently, a goal test G(S) O : Operators O: {S} => {S} Describes the possible actions of the agent g : Path cost function, assigns a cost to a path/action Uninformed (blind) search Is this a goal state or not? Know current path cost (from start to current node) 3 No information about the “goodness” of a state What are we about to do right now?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Example: MU-Puzzle States: Strings comprising the letters M, I, and U Initial state: MI Goal state: MU Operators: (where x stands for any string, including the null string ) 1. x I x IU “Append U” 2. M x M x x Replicate x 3. x I I I y x U y “Replace III with U” M I M I I M I I I I 4. x UU y xy “Drop UU” Path cost: one per step M U I M U I U M U I U U I U Try it Can you draw the state-space diagram? M U I U U I U U I U U I U 4 Are you guaranteed a solution?
Clarification of the MU-puzzle rules: 1. If the string ends with I you may add U; for example, MI becomes MIU 2. If the string is Mx then you may create Mxx; for example, MI becomes MII; MIU becomes MIUIU 3. If the string contains III you may replace those three characters with U 4. If the string contains UU you may eliminate both characters 5

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document