Question 1

STATE SPACE SEARCH\ Background: On a chessboard, a knight can jump from one corner of a 2x3 (or 3x2) rectangle to the opposite corner of that rectangle and there are eight possible jumps (moves) for a knight. Figure from the passage in the original paper Problem Statement:\ Consider a 4x3 chessboard where the allowable positions are marked by alphabets. Figure from the passage in the original paper From an allowable position, a knight can jump over obstacles and land on another allowable position.\ MoveGen takes a position as input and returns an alphabetically ordered list of knight-moves, for example, MoveGen(B) = \[F,G,I\].\ The distance between two positions is equal to the Euclidean Distance between the centers of the unit squares (positions), for example, d(A,A) = 0, d(A,B) = 1, d(A,H) = sqrt(5) and so on.\ Compute the MoveGen function and then answer the sub-questions. The number of unique states in the state space is \_\_\_\_\_\_\_\_\_\_ .\ Enter an integer. NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS. Answer Format: 42 STATE SPACE SEARCH\ Background: On a chessboard, a knight can jump from one corner of a 2x3 (or 3x2) rectangle to the opposite corner of that rectangle and there are eight possible jumps (moves) for a knight. Figure from the passage in the original paper Problem Statement:\ Consider a 4x3 chessboard where the allowable positions are marked by alphabets. Figure from the passage in the original paper From an allowable position, a knight can jump over obstacles and land on another allowable position.\ MoveGen takes a position as input and returns an alphabetically ordered list of knight-moves, for example, MoveGen(B) = \[F,G,I\].\ The distance between two positions is equal to the Euclidean Distance between the centers of the unit squares (positions), for example, d(A,A) = 0, d(A,B) = 1, d(A,H) = sqrt(5) and so on.\ Compute the MoveGen function and then answer the sub-questions. MoveGen(C) is \_\_\_\_\_\_\_\_\_\_ .\ Enter a comma separated list of positions. NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS. Answer Format: A,B,C,D Answers Case Sensitive : No STATE SPACE SEARCH\ Background: On a chessboard, a knight can jump from one corner of a 2x3 (or 3x2) rectangle to the opposite corner of that rectangle and there are eight possible jumps (moves) for a knight. Figure from the passage in the original paper Problem Statement:\ Consider a 4x3 chessboard where the allowable positions are marked by alphabets. Figure from the passage in the original paper From an allowable position, a knight can jump over obstacles and land on another allowable position.\ MoveGen takes a position as input and returns an alphabetically ordered list of knight-moves, for example, MoveGen(B) = \[F,G,I\].\ The distance between two positions is equal to the Euclidean Distance between the centers of the unit squares (positions), for example, d(A,A) = 0, d(A,B) = 1, d(A,H) = sqrt(5) and so on.\ Compute the MoveGen function and then answer the sub-questions. d(G,D) is \_\_\_\_\_\_\_\_\_\_ .\ Enter a decimal number rounded to one decimal place. NO SPACES, TABS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS. Answer Format: 42.1