Assignment # 1

Due by March 20, 2019 (By 11:59 AM)

Q.1. Prove that a monotonic heuristic is admissible. [10 points]
Q.2. Describe and implement 8-Puzzle using the programming language of your choice. You
must use the following search algorithms: [20+20 points]
a. Depth first with iterative deepening. Depth bound would be provided by the user or
the program would set it up to its default value.
b. Best first search. Use at least two different admissible heuristics (other than those
discussed in the class) and compare their performance.
Note:
1. Goal state configuration has the tile ‘1’ in the left top position. Other tiles are
arranged in counter clockwise manner with the blank in the middle of the grid.
2. Submit your code files as a zipped folder in
\\printsrv\Faculty Data\Dr. Syed Muhammad Ali\CS360AI\Submissions\Assignment1
The name of your submission MUST be a combination of your id and assignment
number, e.g., BCSF16M500-Assignment1
3. Submit a hard copy of your assignment by the due date containing problem solutions as
well as code and optionally screenshots of the results.
Extra credit (10 points): For GUI based implementations graphically showing path(s)
taken from the start state to the goal state.