Problem 1978. Sokoban: Puzzle 10.45

Created by Richard Zapor

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://www.game-sokoban.com/index.php?mode=level&amp;lid=16138\"><w:r><w:t>Sokoban Site</w:t></w:r></w:hyperlink><w:r><w:t> has many puzzles to solve. This Challenge is to solve puzzle 10.45. The link may place the Cody enthusiast at 10.55.</w:t></w:r><w:r><w:t> </w:t></w:r><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Sokoban\"><w:r><w:t>wiki Sokoban reference</w:t></w:r></w:hyperlink><w:r><w:t>.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The basic rules are to places the Blocks on the Pedestals. Blocks can only be pushed, never pulled. A connected Pair of blocks can not be moved along their long axis. A 2x2 square of blocks is immoveable. A Wall can not be moved.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Sokoban can not jump blocks or move diagonally.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The map will be double ringed by a Wall(1). Map definitions: Empty(0) Block(2) Pedestal(3) Sokoban(4) Block on Pedestal(5) Sokoban on Pedestal(7).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Sokoban Movement is a numeric vector L(-nr) U(-1) R(nr) D(+1).</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Input:</w:t></w:r><w:r><w:t> Map, [nr,nc] of Sokoban characters [0,1,2,3,4,5,7]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Output:</w:t></w:r><w:r><w:t> Moves, Vector of [-1 +1 -nr +nr] values</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Scoring:</w:t></w:r><w:r><w:t> Sum of Moves and Pushes</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Examples:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Map</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[11111111\n11111111 Moves=[5] push right for a 5 row array\n11042311\n11111111\n11111111]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Test Suite Visualization:</w:t></w:r><w:r><w:t> A visualization option is provided.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:rPr><w:b/></w:rPr><w:t>Algorithms:</w:t></w:r><w:r><w:t> Recursive routines that check all possible pushes can solve small Sokoban puzzles. Routines that limit their depth can find minimal Push solutions at the cost of time. Identification of Locked conditions is important to avoid being stuck in recursion. Pairs of blocks on a wall or too many blocks on a wall are unsolveable conditions to avoid.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

The <a href = "http://www.game-sokoban.com/index.php?mode=level&lid=16138">Sokoban Site</a> has many puzzles to solve. This Challenge is to solve puzzle 10.45. The link may place the Cody enthusiast at 10.55. <a href = "http://en.wikipedia.org/wiki/Sokoban">wiki Sokoban reference</a>.The basic rules are to places the Blocks on the Pedestals. Blocks can only be pushed, never pulled. A connected Pair of blocks can not be moved along their long axis. A 2x2 square of blocks is immoveable. A Wall can not be moved.Sokoban can not jump blocks or move diagonally.The map will be double ringed by a Wall(1). Map definitions: Empty(0) Block(2) Pedestal(3) Sokoban(4) Block on Pedestal(5) Sokoban on Pedestal(7).Sokoban Movement is a numeric vector L(-nr) U(-1) R(nr) D(+1).Input: Map, [nr,nc] of Sokoban characters [0,1,2,3,4,5,7]Output: Moves, Vector of [-1 +1 -nr +nr] valuesScoring: Sum of Moves and PushesExamples:Map<pre class="language-matlab">11111111
11111111 Moves=[5] push right for a 5 row array
11042311
11111111
11111111
</pre>Test Suite Visualization: A visualization option is provided.Algorithms: Recursive routines that check all possible pushes can solve small Sokoban puzzles. Routines that limit their depth can find minimal Push solutions at the cost of time. Identification of Locked conditions is important to avoid being stuck in recursion. Pairs of blocks on a wall or too many blocks on a wall are unsolveable conditions to avoid.

The <http://www.game-sokoban.com/index.php?mode=level&lid=16138 Sokoban Site> has many puzzles to solve. This Challenge is to solve puzzle 10.45. The link may place the Cody enthusiast at 10.55. <http://en.wikipedia.org/wiki/Sokoban wiki Sokoban reference>.

The basic rules are to places the Blocks on the Pedestals. Blocks can only be pushed, never pulled. A connected Pair of blocks can not be moved along their long axis. A 2x2 square of blocks is immoveable. A Wall can not be moved.

Sokoban can not jump blocks or move diagonally.

The map will be double ringed by a Wall(1). Map definitions: Empty(0) Block(2) Pedestal(3) Sokoban(4) Block on Pedestal(5) Sokoban on Pedestal(7).

Sokoban Movement is a numeric vector L(-nr) U(-1) R(nr) D(+1).

*Input:* Map, [nr,nc] of  Sokoban characters [0,1,2,3,4,5,7]

*Output:* Moves, Vector of [-1 +1 -nr +nr] values

*Scoring:* Sum of Moves and Pushes

*Examples:*

Map

11111111
  11111111 Moves=[5]  push right for a 5 row array
  11042311
  11111111
  11111111

*Test Suite Visualization:* A visualization option is provided.

*Algorithms:* Recursive routines that check all possible pushes can solve small Sokoban puzzles. Routines that limit their depth can find minimal Push solutions at the cost of time. Identification of Locked conditions is important to avoid being stuck in recursion. Pairs of blocks on a wall or too many blocks on a wall are unsolveable conditions to avoid.

Solve

Solution Stats

12 Solutions
6 Solvers

Last Solution submitted on Mar 05, 2021

Last 200 Solutions

Problem Recent Solvers6

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1978. Sokoban: Puzzle 10.45

Solution Stats

Last 200 Solutions

Problem Recent Solvers6

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Problem 1978. Sokoban: Puzzle 10.45

Solution Stats

Last 200 Solutions

Problem Recent Solvers6

Suggested Problems

More from this Author255

Problem Tags

Community Treasure Hunt

Players