Scribd
Upload
55 views2 pages

AI Sheet 2 - Structures & Strategies For State Space Search

1. This document is a study sheet for an Artificial Intelligence course covering state space search techniques. 2. It contains 6 questions about key concepts like state space graphs, heuristics, pathfinding, and search strategies. 3. One question asks students to formalize the "Cannibals and Missionaries" puzzle as a state space search problem by defining the representation, initial/goal states, operators, and drawing the first two levels.

Uploaded by

Ahmed Al-Antary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views2 pages

AI Sheet 2 - Structures & Strategies For State Space Search

1. This document is a study sheet for an Artificial Intelligence course covering state space search techniques. 2. It contains 6 questions about key concepts like state space graphs, heuristics, pathfinding, and search strategies. 3. One question asks students to formalize the "Cannibals and Missionaries" puzzle as a state space search problem by defining the representation, initial/goal states, operators, and drawing the first two levels.

Uploaded by

Ahmed Al-Antary
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Helwan University Fall Semester

Faculty of Computers and Artificial Intelligence Artificial Intelligence – CS361


Academic Year (2020/2021) Undergraduate Studies – Level 3

Structures & Strategies for State Space Search


Sheet # 2
No. Of Questions: 4 No. Of Pages: 2

Question 1: Define the following terms:

a. State Space Graph.


b. Exhaustive Search.
c. Heuristics.
d. Path.
e. Rooted Graph.
f. Tree.

Question 2: Describe using drawing the Kongsberg problem "Euler Tour."

Question 3: Determine whether goal-driven or data-driven search would be


preferable for solving each of the following problems. Justify your answer.

a. You have met a person who claims to be your distant cousin, with a common
ancestor named John Doe. You would like to verify her claim.
b. Another person claims to be your distant cousin. He doesn't know the common
ancestor's name but knows that it was no more than eight generations back. You
would like to either find this ancestor or determine that she didn't exist.
c. A theorem prover for plane geometry.

Question 4: Answer the following Questions:

a. Discuss briefly the techniques used to reduce the search complexity when solving
the Traveling Salesman Problem.

b. The following is a problem which can be solved using state-space search techniques:
The Cannibals and Missionaries problem: "Three cannibals and three missionaries
come to a crocodile infested river. There is a boat on their side that can be used by
either one or two persons. If cannibals outnumber the missionaries at any time, the
cannibals eat the missionaries. How can they use the boat to cross the river so that all
missionaries survive?" Formalize the problem in terms of state-space search. You
should:

• Suggest a suitable representation for the problem state.


• State what the initial and final states are in this representation.

1/2
Artificial Intelligence – CS361: Sheet #2 – Structures & Strategies for State Space Search – Fall 2020
• State the available operators/rules for getting from one state to the next,
giving any conditions on when they may be applied.
• Draw the first two levels of the directed state-space graph for the given
problem.

c. Briefly discuss the advantages and disadvantages of depth and breadth first search.
What sort of problem is each appropriate for?

d. How does the use of a closed node list reduce the amount of search required in
graph search?

e. Referencing 4.b, Solve the following problem "A farmer with his dog, rabbit and
lettuce come to the east side of a river they wish to cross. There is a boat at the river’s
edge, but of course only the farmer can row. The boat can only hold two things
(including the rower) at any one time. If the dog is ever left alone with the rabbit, the
dog will eat it. Similarly, if the rabbit is ever left alone with the lettuce, the rabbit will
eat it. How can the farmer get across the river so that all four characters arrive safely
on the other side?"

f. The state space of many two-player games (e.g. chess, checkers, and tic-tac-toe) can
conveniently be represented as And/Or trees. Why? Give an example, stating which
nodes are And and which are Or.

With my best wishes;


Dr. Amr S. Ghoneim

2/2
Artificial Intelligence – CS361: Sheet #2 – Structures & Strategies for State Space Search – Fall 2020

You might also like