Talk:Maze generation: Difference between revisions

Which algorithm? The linked wikipedia article has many. –[[User:Dkf|Donal Fellows]] 13:24, 14 December 2010 (UTC)

:I am quite happy about the freedom to use any algorithm. I am just worried about every example being accompanied with a large maze. --[[User:Paddy3118|Paddy3118]] 14:13, 14 December 2010 (UTC)

::For the purpose of maze generation, it doesn't matter where the entry and exit are. You can break two wholes into the outer wall after tha maze is done, and declare them as "entry" and "exit". --[[User:Abu|Abu]] 16:15, 14 December 2010 (UTC)

::: If you're thinking in terms of “entry and exit”, then the simplest method is to just place just two holes. Otherwise (when start and goal are within the maze) you can try to do things like finding the two places in the maze that have the longest path between them or, more easily, finding the place most distant from the initial seed point (easy to keep track of during building) and the place furthest from that (using a complete breadth-first search). However, such things require maze solution techniques, so it's easiest to just knock holes that are far apart; for a big enough maze, that's a reasonable approach and small mazes are trivial anyway. –[[User:Dkf|Donal Fellows]] 17:30, 18 December 2010 (UTC)