Resources for Assignment 2

The following are the various resources you will need for this assignment:

Assignment Description
Prolog Implementation of IDA*
Prolog Implementation of 8-puzzle domain
Prolog Implementation of Manhattan Distance hueristic
Collection of 8-puzzle Problems categorized by optimal solution length
Prolog code for implementing counters
Load this file into Prolog and it will load the necessary program files
Sample problem with optimal solution length = 18
Sample prolog run using sample problem
Zip file with all the eight puzzle problems for optimal solution lengths from 10 to 25

Instructions for Prolog

There are a number of different Prolog's available. This code was written for SICStus Prolog. You can get a 30-day evaluation copy from the following website: SICStus evaluation site You should find all the information you need to install it when you get the key.

The Prolog files above all have their file extension removed (otherwise youwould not be able to download them). You will need to append ".pl" to them to have SICStus handle them.

Reading List:

The Branching Factor of Regular Search Spaces
Complexity Analysis of Admissible Heuristic Search
Time complexity of iterative-deepening-A∗

Another resource for your research report is the following book:
"Writing for Computer Science" by Justin Zobel published by Springer