7. In chess, a rook can move on a chessboard any number of squares in a straight line, vertically or horizontally, but cannot jump over other pieces. The problem is to move a rook from square A to square B in the smallest number of moves. For example, in the figure below, the red line is a 3-step solution (the x's mark other pieces). Design an admissible heuristic for this