Windy 8-Puzzle Problem
We consider a variant of the 8-puzzle problem (http://tristanpenman.com/demos/n-puzzle) under
a windy condition. The initial state and the goal state are shown as follows: We assume that the wind.
Please look the instructions in the attachments.
Important:
In your report, please provide the screenshots of all outcomes, and the highlighted code segments
and the detailed explanation on how you implement the followings:
Data structure: priority queue for frontier set and hash table for explored set;
Calculation of f(n) = g(n) + h(n);
Adding leaves for expansion;
Picking the smallest f(n).
Each screenshot should include your usernames and the current time, which show that you did it by
yourselves.
