Your goal in the next two programming assignments is to implement Haskell code that can find a shortest sequence of legal moves—an optimal solution—that frees the red car. As part of this assignment, I provide you with a skeleton of this project, which includes • A database of all possible starting positions for the Rush Hour puzzle (rush_no_walls.txt). • A solution checker for the Rush Hour puzzle (rush_hour_check.py). • A skeleton of a Haskell project that takes care of reading a puzzle from the database and writing the results to screen. 1 Your finished Rush Hour solver takes the number of the Rush Hour puzzle in the database to be solved as an argument. It solves the puzzle and then prints the sequence of moves to stdout:
0 comments