# 人工智能代写 | Intro to Artiﬁcial Intelligence Assignment 1: Search algorithms

General Instructions

Teams: Assignment should be completed by teams of two students. No additional credit for
working individually. Use this form https://forms.gle/nFWwmcncohXTVbDE7 to inform the TAs
you either a) have a team (only one member of the team) b) looking for a team or c) working
alone (discourage).

Submission: Submit a PDF ﬁle to Sakai. For the programming questions, submit your code
in a compressed ﬁle. DO NOT submit documents in Word, raw text, images, etc. One submission
per team is enough. Be sure to submit before the deadline (see Sakai). You have unlimited
submission, partial submissions are encourage! Code submitted must run on ilab machines in

Program Demonstrations: Each team will have 10 minutes to demonstrate the implementa-
tion to one TA as well as answer questions on a date scheduled after the deadline. Be sure to
prepare ahead to show the program running.

L ATEX: Extra credit (10%) for submitting answers using L AT EX. If you choose to do this, submit
all ﬁles (*.tex) as a separate compressed ﬁle.

Description

Consider a grid world like the one shown in Fig. 1, where an agent can move freely in the non-
blocked cells. The objective of this assignment is to implement and compare search algorithms
that will allow the agent to move from a given initial state to given goal state without colliding.
Properties of the agent:
• Is deterministic
• Moving left or right has a cost of 1
• Moving up or down has a cost of 2
• Cannot move diagonally

• Read the speciﬁed grid world
• Solve the problem using the speciﬁed algorithm
• Show the resulting path and its cost

The problem.txt ﬁle
By lines (see example on Sakai):
0. Size of the maze N – integer
1. Start state xy – two integers: 0  x, y < N
2. Goal state xy – two integers: 0  x, y < N
3. Algorithm – integer from 0 to 4
4. Maze – integer representing the maze to use

Algorithms:
0. Select one of: Breadth-ﬁrst search or Uniform-cost search
1. Select one of: Depth-limited, Iterative deepening depth-ﬁrst search or bidirectional search
2. A* using one of h0, h1 or h2
3. A* using one of h3, h4 or h5
4. A* using your own heuristic

E-mail: itcsdx@outlook.com  微信:itcsdx