Scribd
Upload
75 views

Assignment1 Artificial Intelligence

The document describes an assignment on artificial intelligence. It contains two questions - the first asks to solve an 8-puzzle problem using uninformed and informed search algorithms like BFS, DFS, and A* and compare the results. The second questions asks to solve a robot navigation problem from location S to G using A* search, providing the reasoning for each step and drawing the search tree. It provides the f(N), g(N), and h(N) values for locations S to G to help solve the problem.

Uploaded by

Umer Naeem
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
75 views

Assignment1 Artificial Intelligence

The document describes an assignment on artificial intelligence. It contains two questions - the first asks to solve an 8-puzzle problem using uninformed and informed search algorithms like BFS, DFS, and A* and compare the results. The second questions asks to solve a robot navigation problem from location S to G using A* search, providing the reasoning for each step and drawing the search tree. It provides the f(N), g(N), and h(N) values for locations S to G to help solve the problem.

Uploaded by

Umer Naeem
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

COMSATS University, Islamabad.

Class: BSE VC Submission Date: 29-10-19


Subject: Artificial Intelligence
Instructor: Dr. Muhammad Imran Marks: 10
Assignment 1
Plagiarized copies will get zero Marks.

-------------------------------------------------------------CLO2-----------------------------------------------------------

Question 1: [Marks: 6]
Consider the scenario of solving an 8-puzzle problem using both uninformed and informed
search algorithms. Write a short report and provide answers for the following set of questions.

• Take a random initial state of an 8-puzzle problem and dry run to solve the problem using
uninformed search algorithms BFS and DFS. (For help, read Section 3.2.3 from Artificial
Intelligence by George F Luger (5th Edition).) (3)
• Take a random initial state of an 8-puzzle problem and dry run to solve the problem using
informed search algorithm A*. Consider number of misplaced tiles as the heuristic function and
calculate the value of f(n) at each step while generating the tree. (For help, read Section 3.6
from Artificial Intelligence by Russell Norvig (3rd Edition).) (3)

Question 2:
Consider robot navigation starts from location S and ends at location G using A* Search. Provide
the reason for each step it takes and draw a search tree. [Marks: 3]

f(N) = g(N)+h(N),
g(N) values are on the link
h(N) values are the following
S = 17
A = 10
A 6
B = 13
C=4
6
6 E 4
D=2 5 3
E=4 S B 7
F G
F=1
6
G=0 1 D
0 C 6

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy