## Notes Information

Login / Sign Up to View Document

## Sample Document Text

1
Problem Solving by
Searching
Lecture #3
9/02/08
Announcements
By now, you should have read Chapters 1-
3 of your text
Read Chapter 4 for Thursday
The missionaries and cannibals
problem
1
Goal: transport 3 missionaries and 3
cannibals from the left bank of a river to
the right bank.
Constraints:
- Whenever cannibals outnumber
missionaries, the missionaries get eaten
- The boat can hold at most two people
- The boat can' t cross the river empty
But both missionaries & cannibals can operate
the boat
1) I apologize for the politically incorrect nature of this problem - I prefer wolves &
sheep - but it's a classic problem and you need to recognize it by its common name
How do you solve this problem?
It' s not an equation
It' s not a continuous function to regress
It' s a set of discrete states connected by
operators
An agent "searches" for an answer by
trying sequences of acti...

## Related Documents

Time Complexity Notes

Search Technique Exam

Search Technique Exam

Specific Goal Notes

Implementation Notes

General Agent Notes

Unfortunately Notes

Optimal Solutions Notes

Complete Assignments Notes

Implementation Notes

Geometrically Notes

Problem State Notes

Problem State Notes

Complete Assignments Exam

Problem State Notes

The Independent Exam

© Copyright 2019 , Koofers, Inc. All rights reserved.

The information provided on this site is protected by U.S. and International copyright law, and other applicable intellectual property laws, including laws covering data access and data compilations. This information is provided exclusively for the personal and academic use of students, instructors and other university personnel. Use of this information for any commercial purpose, or by any commercial entity, is expressly prohibited. This information may not, under any circumstances, be copied, modified, reused, or incorporated into any derivative works or compilations, without the prior written approval of Koofers, Inc.