Answer to Question #132142 in Programming & Computer Science for Noura

Question

Q1)True or False? Justify your answer. Assume cost is always non-negative.
a) Assume that a rook can move on a chessboard any number of squares in a straight line, vertically or horizontally, but cannot jump over other pieces. Manhattan distance is an admissible heuristic for the problem of moving the rook from square A to square B in the smallest number of moves.
b) A* tree search is optimal if the heuristic is consistent.
c) The Euclidean distance is an admissible heuristic for Pacman path-planning
problems.
d) Azeroheuristicisconsistent.
e) The sum of several admissible heuristics is still an admissible heuristic.
f) The admissibility of a heuristic for A* search implies consistency as well.

Answer 1

Dear Noura, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order