Scribd
Upload
14 views2 pages

Sheet2_AI

The document is an assignment for a course on Artificial Intelligence at Alexandria University, focusing on informed search techniques. It includes tasks related to Greedy Search, A* Search, and heuristic evaluations in the context of a maze and a map. Students are required to provide sequences of expanded states and justify the admissibility of various heuristics.

Uploaded by

Heba Abd Elatty
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
14 views2 pages

Sheet2_AI

The document is an assignment for a course on Artificial Intelligence at Alexandria University, focusing on informed search techniques. It includes tasks related to Greedy Search, A* Search, and heuristic evaluations in the context of a maze and a map. Students are required to provide sequences of expanded states and justify the admissibility of various heuristics.

Uploaded by

Heba Abd Elatty
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

Alexandria University CC482: Artificial Intelligence

Faculty of Engineering
Computer and Communications
Engineering – SSP Deadline: 5/4/2020

Sheet 2 : Informed Search


1. Consider the following figure. The numbers on the arcs are the arc cost; the heuristic estimates
for states B, C, and D are equal 1, 6,and, 3 respectively and all other states have a heuristic
estimate of 0. Assume that the children of a node are expanded in alphabetical order when no
other order is specified by the search, and that the goal is state J. No visited or expanded lists
are used. What order would the states be expanded by each type of search. Write only the
sequence of states expanded by each search.

a) Greedy Search.
b) A∗ Search.

2. Consider the following maze in which the successors of a cell include any adjacent cell in the
directions North, South, East, and West of the current cell, except at the boundary of the
maze or when a barrier (thick line) exists. For example, successors (M) = {D,N,G}. Assume
each move has cost 1. The problem is to find a path from cell S to cell G.
From (a) to (f) what is the order of nodes expanded (plus the goal node if it is found) by each
of the following search methods? Show the steps.

a) Greedy Search. Use as the heuristic function h (state) = Manhattan distance from state to G
assuming there were no barriers. For example, h (K) = 2 and h(S) = 4.
b) Hill-Climbing Search. Use the same heuristic function as in (a).
c) A∗ Search. Use the same heuristic function as in (a). Remove redundant states.
d) Is h an admissible heuristic? Justify your answer.
e) Is h2 (state) = min (2; h (state)) an admissible heuristic? Justify your answer.
f) Is h3 (state) = max (2; h (state)) an admissible heuristic? Justify your answer.

Dr. Amira Youssef – Dr. Sherin Aly Eng. Heba Abd El Atty Page 1 of 2
Alexandria University CC482: Artificial Intelligence
Faculty of Engineering
Computer and Communications
Engineering – SSP Deadline: 5/4/2020

3. Given the following map:

If “Dallas” is the starting city and the goal destination is “Sault Ste Marie”. Use A∗ search
algorithm to find a route from the start to goal destination.

• The table on the right is the estimated heuristic distance from each city to the goal.
• Show the sequence of the nodes that the algorithm will consider and f, g and h score for
each node.

Good Luck

Dr. Amira Youssef – Dr. Sherin Aly Eng. Heba Abd El Atty Page 2 of 2

You might also like