Scribd
Upload
123 views

Ai Assignment 1

The document provides information about an assignment for an Artificial Intelligence Fundamentals course at the Canadian College of Modern Technology. It includes the department, instructor's name, due date, and identifies the student submitting the assignment by name, ID number, department, and email.

Uploaded by

issaalhassan turay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
123 views

Ai Assignment 1

The document provides information about an assignment for an Artificial Intelligence Fundamentals course at the Canadian College of Modern Technology. It includes the department, instructor's name, due date, and identifies the student submitting the assignment by name, ID number, department, and email.

Uploaded by

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

CANADIAN COLLEGE OF MODERN TECHNOLOGY

1 SILICON HILLS MILE 91

DEPARTMENT OF COM. SCI. AND BIT FINAL YEAR

ARTIFICIAL INTELLIGENCE
FUNDAMENTALS

INSTRUCTOR: Mr. Hamid Milton Mansaray

DUE DATE: February 24th 2021

SUBMITTED BY: ISSA A. TURAY

ID NO: 18290214

DEPARTMENT: COMPUTER SCIENCE

EMAIL: [email protected]
Q1. Solution

Given:

Consider the tree shown below. The numbers on the arcs are the arc lengths.

Assume that the nodes are expanded in alphabetical order when no other order is specified by the
search, and that the goal is state G. No visited or expanded lists are used. What order would the
states be expanded by each type of search? Stop when you expand G. Write only the sequence of
states expanded by each search.

Completed Table:

Search Type List of States

Breadth First ABCDEG

Depth First ABDFKLECG

Progressive Deepening Search AABCABDECG

Uniform Cost Search ABDECFG

Page 1 of 6
Q2. Solution

Given:
Consider the graph shown below where the numbers on the links are link costs and the numbers next
to the states are heuristic estimates. Note that the arcs are undirected. Let A be the start state and G
be the goal state.

Simulate A* search with a


strict expanded list on this graph.
At each step, show the path
to the state of the node that’s
being expanded, the length
of that path, the total estimated cost of the path (actual + heuristic), and the current value of the
expanded list (as a list of states). You are welcome to use scratch paper or the back of the exam
pages to simulate the search. However, please transcribe (only) the information requested into the
table given below.

Completed Table

Path to State Expanded Length of Path Total Estimated Cost Expanded List
A 0 5 (A)

C–A 3 4 (C A)

B–A 1 5 (B C A)
(H B C A)
H–C–A 5 6

G–H–C–A 6 6 (G H B C A)

Q3. Solution
Page 2 of 6
Consider the graph shown below. Note that the arcs are undirected. Let A be the start state and G be
the goal state.

Simulate uniform cost search with a strict expanded list on this graph. At each step, show the state of
the node that’s being expanded, the length of that path, and the current value of the expanded list
(as a list of states).

Completed Table

State Expanded Length of Path Expanded List


A 0 (A)
B 2 (B A)
C 4 (C B A)
G 6 (G C B A)

Reference:
George luger, Quiz 1, spring 2004 – Solutions open notes
Page 3 of 6
Page 4 of 6

You might also like