02-lecture2 - CS470 Fall 2010 Lecture 2: Search Alice Oh...

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

View Full Document Right Arrow Icon
CS470 Fall 2010 Lecture 2: Search Alice Oh alice.oh@kaist.edu Sept 7, 2010 1 Monday, September 6, 2010
Background image of page 1

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

View Full DocumentRight Arrow Icon
Administrivia • Register on Moodle CS470 because • all schedules, handouts, links, etc. will be posted there • announcements will be emailed to you via Moodle • It’s important to know Python; a tutorial link is on Moodle • The frst quiz (on search) is next week on September 16th • IF I am talking too Fast, please raise your hand • Email me For lecture questions; email TAs For project questions 2 Monday, September 6, 2010
Background image of page 2
Lecture Contents • Search • What is search? • Why do we search? • Formalize a problem as a search problem • Basic uninformed search • Depth First Search • Breadth First Search • Uniform-Cost Search • Iterative Deepening • Bidirectional Search • Informed Search • Heuristic Search • Is search intelligence? 3 Monday, September 6, 2010
Background image of page 3

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

View Full DocumentRight Arrow Icon
What is Search? • Deciding on a sequence of actions to get to a goal • Goal-directed agent • Assumptions about environment • Discrete • Static • Observable • Deterministic 4 Monday, September 6, 2010
Background image of page 4
Why do we search? Because we can frame many problems as search problems A B 5 Monday, September 6, 2010
Background image of page 5

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

View Full DocumentRight Arrow Icon
Games as Search Problems 8-Puzzle Problem 1 2 4 3 5 6 7 8 1 2 4 3 5 6 7 6 Monday, September 6, 2010
Background image of page 6
Formulation of a Search Problem • Start State • State Space • Successor Function • Goal State • Path Cost 7 Monday, September 6, 2010
Background image of page 7

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

View Full DocumentRight Arrow Icon
8-Puzzle as a Search Problem What are some possible successor functions? Depending on your successor function, what is the state space? How should we deFne path cost? 1 2 4 3 5 6 7 8 1 2 4 3 5 6 7 Start State Goal State Discussion Exercise 1 8 Monday, September 6, 2010
Background image of page 8
Discussion Exercise 2 8 Queens Problem Goal : Place 8 queens on the board such that no queen attacks any other. A queen attacks any piece in the same row, column or diagonal. Starting State: an empty Board Goal State: 8 queens on the board with no attacks Successor Function 1: add a queen to any space Successor Function 2: add a queen to any square in the leftmost empty column such that no existing queens can attack it How are the state spaces different for SF1 and SF2? 9
Background image of page 9

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

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 35

02-lecture2 - CS470 Fall 2010 Lecture 2: Search Alice Oh...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online