Please take your time to try the game and not just answer it based on the inform
ID: 2246800 • Letter: P
Question
Please take your time to try the game and not just answer it based on the information presented here.
Please answer these parts for the puzzle described below.
For the puzzle described below:
a. Describe states that make up the puzzle's state space and give an upper bound for the number of distinct states. Note that this bound may depend on the size of a puzzle instance.
b. Suggest a computer representation --- that is, data structure(s)--- for a puzzle state. Be explicit enough that you can answer part c precisely.
c. Given the representation you have described, what operators are necessary for transforming one state into another; that is, for implementing moves in the puzzle. Describe one representative operator in detail.
d. Suggest a heuristic state evaluation function that can guide a search of the puzzle's state space toward a/the goal state. Explain briefly why your heuristic is better than a blind search?
2. This puzzle is called Sokoban. Link to it is right here. https://webdocs.cs.ualberta.ca/~games/Sokoban/
The little figure can move vertically and horizontally, and the object is for the figure to push all the stones in the maze into specially-marked goal positions. Note that the figure can only push the stones; the puzzle cannot be solved from a configuration in which a stone is in a (non-goal) corner or only able to be pushed into such a corner, though such configurations are legal states of the puzzle.
For more details and many example puzzles, follow the link. For the questions above, assume that the maze has n spaces into which the figure and stones can move and that there are k stones.
Here's a link to an implementation of the puzzle that you can play. https://www.sokobanonline.com/
Explanation / Answer
2)