Lecture 2a: Introduction to Search - Parte2

What is the objective of the Cryptograms problem?

• To find the best route from one point to another

• To find digits for each letter so that the sum is correct

• To transfer disks from one tower to another

• To determine which operations to carry out so that the first bucket contains n liters

What is the objective test for the Vacum Cleaner Problem?

• To find the best route from one point to another

• All states in the set cannot have garbage

• To visit each point at least once in a given space

• There is no trash in any of the squares

What is the initial state for the Vacum Cleaner Problem?

• 8 states represented

• Any

• Subset of represented states

• 3 missionaries and 3 cannibals are on one side of the river with a boat

What is the objective of the Routes/Path Finding Problem?

• To transfer disks from one tower to another

• To find the best route from one point to another

• To visit each point at least once in a given space

• To determine which operations to carry out so that the first bucket contains n liters

What is the objective of the Missionaries and Cannibals Problem?

• To take 3 missionaries and 3 cannibals to the other side of the river without leaving more cannibals than missionaries on one of the banks

• To determine which operations to carry out so that the first bucket contains n liters

• To transfer disks from one tower to another

• To find the best route from one point to another

What are the only operations that can be performed in the Bucket Filling Problem?

• left, right, vacuum

• empty a bucket, fill a bucket, pour one bucket into the other until the second is full, pour one bucket into the other until the first is empty

• visit each point at least once in a given space

• replace all occurrences of a letter with a digit

What is the objective test for the Vacum Cleaner without Sensors Problem?

• All states in the set cannot have garbage

• To visit each point at least once in a given space

• There is no trash in any of the squares

• To find the best route from one point to another

What is the objective of the Hanoi Towers Problem?

• To determine which operations to carry out so that the first bucket contains n liters

• To transfer disks from one tower to another

• To take 3 missionaries and 3 cannibals to the other side of the river without leaving more cannibals than missionaries on one of the banks

• To transfer disks from tower C to tower A without placing a disk on a smaller disk

What is the state set for the Vacum Cleaner without Sensors Problem?

• 8 states represented

• Subset of represented states

• Any

• 3 missionaries and 3 cannibals are on one side of the river with a boat

What is the solution cost for the Vacum Cleaner Problem?

• Each action costs 1 (total cost = number of solution steps)

• Each action costs 1 (total cost = number of solution steps)

• Each action costs 1

• Each action costs 1 (total cost = number of solution steps)