Search results

From Sokoban Wiki

Jump to: navigation, search
For more information about searching Sokoban Wiki, see Help.

Showing below 35 results starting with #1.

View (previous 250) (next 250) (20 | 50 | 100 | 250 | 500)

Page title matches

Page text matches

  • Feature list : General Information
    … table uses the term "unlimited" here. In this context, it means the same, and it avoids burdening the reader with unnecessary details like "limited by m…
    4 KB (465 words) - 20:10, 4 January 2017
  • Feature list : Game Play
    …res || {{yes}} with reachable squares || {{tc}} | mouse move control: drag and drop || {{yes}} with reachable squares || {{no}} || {{no}} || {{yes}} part… …{{tc}} | [[#Mouse_Move_Control:_Select_and_drop|mouse move control: select and drop]] || {{yes}} with reachable squares || {{yes}} with reachable squares…
    14 KB (1837 words) - 17:42, 27 October 2019
  • Feature list : Customizing
    For the convenience of users and updates are groups all backgrounds in a single folder.<br>One can also cho…
    5 KB (587 words) - 13:15, 15 April 2013
  • Solver Statistics
    For copyrights, credits and redistribution of these statistics, please read the disclaimer. Redistribution and use of the Sokoban Solver statistics are permitted
    19 KB (2130 words) - 19:04, 26 March 2024
  • First Sokoban program
    …/Sokoban Sokoban] game was invented in 1981 by Hiroyuki Imabayashi, Japan, and was first published by his software company, ''Thinking Rabbit'', in Decem… …asn't been solved, the player is given the choice between exiting the game and restarting the level.
    4 KB (655 words) - 06:01, 12 April 2024
  • General Sokoban information
    The reason for this is that the player can only move up, down, left and right: This means all darker squares are reached with an odd number of moves and all brighter squares are reached with an even number of moves.<br>
    2 KB (435 words) - 22:04, 23 January 2023
  • The rules of the game
    Some floor squares contain boxes and some are marked as storage locations. To move a box, the player walks up to it and pushes it to the square beyond.
    974 B (172 words) - 18:23, 23 April 2024
  • Rolling Stone solver
    …uzzle solving. Developed at the University of Alberta by Andreas Junghanns and Jonathan Schaeffer, it laid the groundwork for many modern solvers. It starts by searching for a solution with a limited depth and gradually increases the depth limit until a solution is found or it's prov…
    4 KB (695 words) - 15:16, 21 March 2024
  • Scientific research
    …>[https://en.wikipedia.org/wiki/Branching_factor branching factor</span>]) and the possibly long sequence of moves needed to reach a solution (<span clas… The Sokoban game provides a challenging testbed for developing and evaluating planning techniques.
    2 KB (240 words) - 18:46, 23 April 2024
  • Links
    …o several web-sites with Sokoban related material, e.g., programs, levels, and publications.
    5 KB (583 words) - 11:39, 1 November 2023
  • DHolland S1
    …n the search. In a nutshell, I'm interested in restricted search, planning and heuristics. == Man access, push squares and push access ==
    26 KB (4586 words) - 20:17, 9 November 2015
  • Sokoban solver "scribbles" by Brian Damgaard about the YASS solver
    …als or parking squares. The score for the starting position is "infinity", and then the score decreases for each completed phase. …le. This level requires pushing almost all the boxes through the goal area and parking them on the right side of the board before they can be pushed to t…
    69 KB (10734 words) - 16:40, 3 August 2018
  • Feature list : Map Viewing
    …{yes}} {{tip|flaw: Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{tc}} | resize skin to fit… …{yes}} {{tip|flaw: Windows has 2 font settings, small (default) and large, and this only works for small fonts|text=flaw}} || {{tc}} | resize window to f…
    9 KB (1197 words) - 21:51, 24 March 2015
  • Heiner's solver
    I'm [[User:Heiner|Heiner]], and have written a "brute force" sokoban solver. And I had an idea how to compute a certain class of deadlocks
    9 KB (1413 words) - 20:49, 21 October 2015
  • DHolland S2
    …xes and the man are removed); thus it is uniquely determined by the puzzle and does not depend on the variation (the pushing of the boxes). …ls, the potential to merge the two corrals (in either direction) is there, and it is more likely to be possible, all things being equal, than if neither …
    14 KB (2610 words) - 20:05, 10 November 2015
  • DHolland S3
    …in P is "isolated" if the eight adjacent squares (horizontally, vertically and diagonally) are all empty. …starting with the man's square and moving to adjacent squares horizontally and vertically. More generally, external corrals could enter into the dictiona…
    95 KB (16821 words) - 21:56, 23 November 2015
  • Solver
    == Terms and Definitions == …level contains a board and usually additional data like title, author name and solutions.
    44 KB (7181 words) - 12:56, 13 April 2024
  • Solving Sokoban Optimally with Domain-Dependent Move Pruning - Stolen Ideas, Lies, and Incompetence
    …Sokoban Optimally with Domain-Dependent Move Pruning - Stolen Ideas, Lies, and Incompetence Dear Sirs and Madams:
    93 KB (14213 words) - 06:09, 17 June 2016
  • SolverStatistics-yass-KenyamSetA
    …0:00:01 YASS 2.141 OK 373 82 back and forth
    5 KB (249 words) - 08:58, 7 March 2017
  • Solver Statistics - BoxWorld - Various Authors
    …ome people might be interested in how long it takes to solve a given level and/or how good the solution is (optimal or not), <br> this summary disregards all timing associated with solving the levels and solution statistics. <br><br>
    15 KB (1813 words) - 21:42, 11 March 2019
  • Solver Statistics - Kenya Maruyama
    …ome people might be interested in how long it takes to solve a given level and/or how good the solution is (optimal or not), <br> this summary disregards all timing associated with solving the levels and solution statistics. <br><br>
    8 KB (915 words) - 03:40, 13 April 2019
  • SolverStatistics-Pereira-ThinkingRabbit-XSokoban-Push-Optimal
    Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban
    557 B (61 words) - 15:32, 20 November 2016
  • Deadlocks
    The player is represented by an arrow, a box by a sphere, and a goal by a small hole. …pushed the box one square up, the box would still be pushable (to the left and right), but no matter what the player does, it won't be possible to push t…
    5 KB (925 words) - 16:57, 20 March 2024
  • JSoko Solver
    The solver uses the PI-Corral pruning developed by Brian Damgaard and me to reduce the search tree. all boxes are placed on goals and the search tries to remove one box at a time.
    3 KB (477 words) - 23:27, 28 January 2017
  • Feature list : Miscellaneous
    … || {{yes}} Java help || {{yes}} html pages (htm) || {{tc}} | builtin help and program information || {{yes}} ascii text document || {{yes}} via Windows … …dows Mobile help system; use "Start &gt; Help" for context-sensitive help; and "Menu &gt; Instructions" for generic help}} || {{no}} || || ||
    5 KB (637 words) - 18:41, 25 January 2018
  • Main Page
    The game was designed in 1981 by Hiroyuki Imabayashi, and first published in December 1982. Today Sokoban is one of the most popular thought and logic games.
    2 KB (331 words) - 18:24, 23 April 2024
  • Total statistics Sven 501-1000
    …ome people might be interested in how long it takes to solve a given level and/or how good the solution is (optimal or not), <br> this summary disregards all timing associated with solving the levels and solution statistics. <br><br>
    71 KB (7496 words) - 17:12, 2 May 2019
  • Total statistics Sven 1-500
    …ome people might be interested in how long it takes to solve a given level and/or how good the solution is (optimal or not), <br> this summary disregards all timing associated with solving the levels and solution statistics. <br><br>
    71 KB (7437 words) - 17:10, 2 May 2019
  • Total statistics Sven 1001-1623
    …ome people might be interested in how long it takes to solve a given level and/or how good the solution is (optimal or not), <br> this summary disregards all timing associated with solving the levels and solution statistics. <br><br>
    88 KB (9222 words) - 17:13, 2 May 2019
  • Sokoban solver "scribbles" by Florent Diedler about the Sokolution solver
    …/ 10. I chose C++ because it is a very fast low-level language really fast and we can have the full control of the memory thanks to the pointers. …ber of boxes is 255. Then, Sokolution can solve levels up to 100 for width and 100 for height.
    17 KB (2967 words) - 22:58, 27 March 2019
  • Solver Statistics - Original Extra - Various Authors
    …ome people might be interested in how long it takes to solve a given level and/or how good the solution is (optimal or not), <br> this summary disregards all timing associated with solving the levels and solution statistics. <br><br>
    7 KB (713 words) - 03:43, 13 April 2019
  • How to detect deadlocks
    # PULL the box from the goal square to every possible square and mark all reached squares as visited … a simple deadlock square ? If yes, then the whole situation is a deadlock and the level has become unsolvable.
    11 KB (2078 words) - 19:27, 13 September 2019
  • Sok format
    :: ... (more saved games and solutions) :: :: File notes consist of unstructured text and ::
    14 KB (1486 words) - 07:45, 3 May 2024
  • Level format
    Some levels have walls, boxes and goals outside the player reachable area to create a better look. Some websites and programs also allow levels that aren't surrounded by walls.
    8 KB (1332 words) - 02:40, 17 April 2021

View (previous 250) (next 250) (20 | 50 | 100 | 250 | 500)

Advanced search

Search in namespaces:

   
   
   
   
   
   
   
   

Search for  
Views
Personal tools
Toolbox