Lecture 8
- Lecture 8
Video
Problem Solving through searching
- The bridges of konigsberg problem
- 4 parts of city
- red part = bridge
- walk around city going each bridge exactly once
- can u do it?
- A,B,C,D are parts of city
- edge represent bridge
-
modelled problem as graph
- Travelling salesman problem
- edge represent node n/w
-
weight is distance
- Romania
- I am at Arad
- network is road network
- I have to reach Bucharest to take flight
- so arad se bucharest kaise pahunchu time pe
Searching
Canonical Problem Formulation
Route Finding
Search Space
Basic Search Algorighm
General Search Algo
Expanding nodes
Adding to Fringe
Managing the Fringe
Modeling of Problems
Tree Search eg - Romania
- fringe me kya hoga
- only arad ke neighbors abhi
- I go at sibiu
Example - the 8-puzzle
Searching Strategies
Uninformed search strategies
- blind search
BFS
- for 8 puzzle
- we are enumerating all paths, not in random manner but in BFS manner
Properties
