Terms field - the level, whole playing area of the current game. Position - a phase, set-up in the field.
Final position - a position in which no turn is possible - either the goal or a deadlock. Box - same as crate. Theory Just a little bit of logic - it seems obvious but we'll use it in the implementation part. You can create a brute force solver that tries to move your man in every possible direction. By using recursion (or a stack) you can track back your steps if a solution is not found. A* probably won't do you any good, because you don't have to find your way through a maze, but also need to move the boxes.
Sokoban You are encouraged to solve this task according to the task description. Typecons, std. Exception, std. Solving Algorithm at Sokoban Software Informer NTONYXIt is an easy to use, real- time tool for Morphing the Harmony, Meter, Rhythm. Sokoban Solving Algorithm software. Sokoban-planner - A C++ algorithm to provide automatic solutions for sokoban game.
This means you may need to take a step back in the same direction you came from after moving a box. So for every step you need to evaluate all directions, including the one you came from. Romancing Saga Rom here. That is, unless you didn't move a box in the previous step.
[edit] You could use A* to make it a little smarter; to find a way from your current position to any of the positions you can move a box from. That would probably make your solution more efficient, because you won't have to track all positions inbetween, but only the positions from the last box you pushed to the next box you'll push. That last step is what you can do with trial and error (brute force). It will take forever for a human to blindly try every direction, but for a computer that is no problem at all. Hotstar Serial App.
Like I said before, you don't have to remember every step the man takes, but only the steps that move a box. The only thing you need to remember(to store) are the actual updated field after the last move, and for each step, the old and new position of the box that moved. All other data can be deducted by rolling back staps on you stack. Gemini Groove Pro Dj-software Rapidshare here. – Nov 21 '10 at 13:11 •. As for detecting deadlocks: you need to store some value for each field state.
If the value is in your list of previous states, that means that that situation has occurred before, and you're in a loop. You can store a hash of the board, but maybe you can store the entire board as well. You can store the position of boxes in the field if you want. 10 boxes in a 256x256 field can be stored in only 20 bytes. If your fields are smaller, you can even compress this data a little. Even a stack of a million attempts 'only' takes 20MB to store, which is peanuts for any modern computer.
– Nov 21 '10 at 13:15.
README.md sokoban-planner A C++ algorithm to provide automatic solutions for sokoban game The C++ planner aims at exploring another way to represent the Sokoban problem, trying to avoid deadlock detection. It is faster than the PDDL planners.
The basic idea is to start from the final state of a puzzle (the destination block), and from there works its way back to the initial state. In other words, it transforms a “push” action into a “pull” action. The precondition of a pull action is that the player has a box in front of him, and he has a empty spot behind him. By considering a plan as a sequence of “pull” actions from the target destination to its initial state, the box will never in a state of deadlock. This representation avoids the time consuming process of checking deadlocks. The searching algorithm is also based on Breadth First Search.
The player will first check if there’s a box in front of him, and if that box is “pullable”, for one direction. If there’s no box in front of him, he will check if he can move one step in that direction. The strategy for moving multiple boxes is that whenever there is a box in front of the player, he will go check if it is pullable, regardless of box labels. As to the sequence of four directions for checking, I’m kind of inspired by bug algorithm in motion planning. So a strategy is applied here. Each time after a temp map is pulled out of the queue, the player first looks for the nearest box position, regardless of the obstacles along the path, and roughly calculates in which direction he should move towards that box.