1
$\begingroup$

I would like to solve the sokoban puzzle : consists in moving acharacter in a 2D map to push boulders into target cells. Each turn,the player can move to an adjacent cell (no diagonals) if it is empty, or push a boulder one step further. To push a boulder, the player needs to stand next to it, and the space behind the boulder needs to be empty (no other boulders and no walls).

using the STRIPS planner and I am having a hard time defining the fixed and dynamic relations and also the preconditions and effects of each operator for this puzzle. Any help is appreciated.

Thanks

New contributor
Peyton is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
$\endgroup$
  • $\begingroup$ A naive assumption is, that the rules of the Sokoban game are known in advance and there is no need to acquire the action model. If the player executes a certain action he is on a new position. The problem is, that the normal Sokoban game rules are different from a domain model, which is needed by a strips planner. The reason is, that the action model consists of hierarchical layers which aren't available in the vanilla sokoban game. The task is to analyze the plan traces and create a symbolic game with more rules than the original Sokoban one. $\endgroup$ – Manuel Rodriguez Nov 9 at 9:49

Your Answer

Peyton is a new contributor. Be nice, and check out our Code of Conduct.

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.