Manhattan Distance as Heuristic & Algorithm IT Assignment Help

Assignment Task

Task

Write a Lisp program to solve the 8-Puzzle using A* search using the Manhattan distance as your heuristic. Your algorithm should be invoked by the function: 
where start is the current state of the problem and end is the desired goal state. Both start and end should be a single list containing the digits 0-8, where 0 represents the blank's position. You expected to error check that both start and end are legal" boards containing all nine digits exactly once. 
Your program should output the sequence of moves necessary to solve the problem. 
NOTE: Not all board configurations will lead to a solution. You con easily snap out two of the plastic pieces from the board and switch their positions -- which may lead to an unsolvable puzzle! 
 

This IT Assignment has been solved by our IT Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
    
Be it a used or new solution, the quality of the work submitted by our assignment Experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.