User contributions
From Sokoban Wiki
(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)
- 09:23, 8 June 2010 (hist) (diff) DHolland S3 (→A partly iterative implementation of SOLVE: added subsections "Goal-matching free space" and "Packing maze free space")
- 20:22, 29 May 2010 (hist) (diff) DHolland S3 (→Flow deadlock detection: revamped section with data structures)
- 09:20, 25 May 2010 (hist) (diff) DHolland S3 (→A partly iterative implementation of SOLVE: shuffling through doors described)
- 15:31, 24 May 2010 (hist) (diff) DHolland S3 (→A partly iterative implementation of SOLVE: corrected flow regions from two to three)
- 15:25, 24 May 2010 (hist) (diff) DHolland S3 (→complexity, tree size and branching factor: added subsection on partly-iterative implementation of SOLVE)
- 11:29, 6 May 2010 (hist) (diff) DHolland S3 (→Note for conventional searches and Sokoban programs: push-minimal abandoned)
- 11:18, 6 May 2010 (hist) (diff) DHolland S3 (→Flow deadlock detection: memory costs and push-route costs examined more closely)
- 12:46, 5 May 2010 (hist) (diff) DHolland S3 (→complexity, tree size and branching factor: corrected worst-case for macros to 16N not 4N)
- 12:32, 5 May 2010 (hist) (diff) DHolland S3 (→Reversible regions, sources and sinks: added subsection on Flow deadlock detection)
- 22:00, 29 April 2010 (hist) (diff) DHolland S3 (→Section 3 Algorithms: d1-door definition final revision. Example explained)
- 21:29, 29 April 2010 (hist) (diff) DHolland S3 (→One-way system (definition): one-way system example)
- 10:52, 29 April 2010 (hist) (diff) DHolland S3 (→One-way system (definition): revised definition explaining conditions)
- 10:40, 29 April 2010 (hist) (diff) DHolland S3 (→One-way doors (definition): revised definition with explanation of conditions)
(Latest | Earliest) View (newer 50) (older 50) (20 | 50 | 100 | 250 | 500)