Answered You can hire a professional tutor to get the answer.
(Challenge problem: +10 points extra credit). Come up with your own algorithms for searching for a solution.
(Challenge problem: +10 points extra credit). Come up with your own
algorithms for searching for a solution. You may use A* with any heuristic
you like, rely on precomputed sub-problems, or use any other algorithm you
can think of. Run your algorithm on 100 n n puzzles and report moves,
search steps and wallclock time, as above. We will post a leaderboard on the
course web page with the top solutions for n = 5 and n = 8, and award extra
credit for solutions that perform particularly well on either measure.
If you decide to use an algorithm that does not run perform move()
directly as part of its search, it may not be obvious how to measure how
many steps it takes. If that is the case, use your judgement and measure the
number of steps in whatever way is most appropriate. In particular, every
step" should take O(1) time: the running time of a step should not depend
on the number of rows and columns of the puzzle.
And the rest of the assignment
