-2
$\begingroup$

how to solve this puzzle in A* algorithm with the Manhattan distance heuristic

$\endgroup$
2
  • $\begingroup$ Is this a homework problem or an exam problem ? $\endgroup$
    – Nobody
    Nov 19 at 11:35
  • $\begingroup$ Don't use images as main content of your post. This makes your question impossible to search and inaccessible to the visually impaired; we don't like that. Please transcribe text and mathematics. You can use LaTeX. Also, we require you to attribute the source of the material in the image: cs.stackexchange.com/help/referencing $\endgroup$
    – D.W.
    2 days ago

1 Answer 1

-1
$\begingroup$

I think this problem and A* algorithm with respect to this problem is discussed in the book called "AI modern approach" by Stuart Russell and Peter Norvig. I've seen that problem in 3rd edition, so I would suggest you check that.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.