Assignment 3.pdf - Adobe Reader File Edit View Window Help 11/21- 114% ToolsSignComment Sign In Export PDF Files CS370- SE Create PDF Files Adobe PDF Pack Convert files to PDF and easily combine them with other file types with a paid subscription. Select File to Convert tO PDF: 1. Consider the puzzle shown next. Green square is the A start block and red square is the goal block. The green block can move one square at a time in the 4 directions (Left, right, up, down) Select File Give a formulation of the search problem. Solve the problem using greedy search with the Manhattan distance as heuristic. Show the search tree Solve the problem using A* search using Manhattan distance as heuristic. Show the search tree a. Send Files b. D c. 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. Can the Manhattan distance be considered an admissible heuristic for the problem of moving the rook from square A to square B in the smallest number of moves? 2. Solution: No. The Manhattan distance may over-estimate the optimal remaining number of moves to the goal because a rook may cover several squares in a single Type here to search 8-44 PM 10/8/2017 Assignment 3.pdf - Adobe Reader File Edit View Window Help 11/21- 114% ToolsSignComment Sign In Export PDF Files CS370- SE Create PDF Files Adobe PDF Pack Convert files to PDF and easily combine them with other file types with a paid subscription. Select File to Convert tO PDF: 1. Consider the puzzle shown next. Green square is the A start block and red square is the goal block. The green block can move one square at a time in the 4 directions (Left, right, up, down) Select File Give a formulation of the search problem. Solve the problem using greedy search with the Manhattan distance as heuristic. Show the search tree Solve the problem using A* search using Manhattan distance as heuristic. Show the search tree a. Send Files b. D c. 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. Can the Manhattan distance be considered an admissible heuristic for the problem of moving the rook from square A to square B in the smallest number of moves? 2. Solution: No. The Manhattan distance may over-estimate the optimal remaining number of moves to the goal because a rook may cover several squares in a single Type here to search 8-44 PM 10/8/2017