![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
|
|
![](v3_space.gif) |
![](v3_space.gif) |
What do these have in
|
|
|
common?
|
|
|
|
|
|
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
• |
Booking a flight
|
|
|
• |
Scheduling a
meeting
|
|
|
• |
Playing chess
|
|
|
• |
VLSI Layout
|
|
|
• |
Construction
Planning
|
|
|
• |
Parsing Grammars
|
|
|
• |
Robot Navigation
|
|
|
• |
Assembly
Sequencing
|
|
• |
etc. etc. etc.
|
|
|
|
|
|
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
![](v3_space.gif) |
Problems
which can be
|
|
|
formulated
as a discrete
|
|
search
through states
|
|
|
for
an acceptable goal
|
|
|
state.
|
|
|
|
|
|
|
|
![](v3_master03_image003.gif) |
|
|