section1_notes - Intelligent Machines: Reasoning, Actions...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: Intelligent Machines: Reasoning, Actions and Plans – CS182 Harvard School of Engineering and Applied Sciences Sep 11, 2009 Gaston A. Fiore Handout 1 Section Problems 1 1. Give the initial state, goal test, successor function, and cost function for each of the following. Choose a formulation that is precise enough to be implemented. (a) You have to color a planar map using only four colors, in such a way that no two adjacent regions have the same color. (b) A 3-foot-tall monkey is in a room where some bananas are suspended from the 8-foot ceiling. He would like to get the bananas. The room contains two stackable, movable, climbable 3-foot-high crates. (c) You have a program that outputs the message “illegal input record” when fed a certain file of input records. You know that processing of each record is indepen- dent of the other records. You want to discover what record is illegal....
View Full Document

This note was uploaded on 04/23/2010 for the course QWE asd taught by Professor Asd during the Spring '10 term at University of Karachi.

Page1 / 2

section1_notes - Intelligent Machines: Reasoning, Actions...

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

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