Question

i 想实施回收后转轨法,以解决马奇问题,但可以理解2.3指挥部(“拆除目前囚室和选定牢房之间的隔离墙”)会帮助我吗?

Mark the current cell as Visited
If the current cell has any neighbours which have not been visited
1. Choose randomly one of the unvisited neighbours
2. add the current cell to the stack
3. remove the wall between the current cell and the chosen cell
4. Make the chosen cell the current cell
5. Recursively call this function
else
1. remove the last current cell from the stack
2. Backtrack to the previous execution of this function

Edit In fact I want an algorithm to solve maze problem by using stack.

Answer 1

这一算法是马齐雷generator而不是马齐雷solver<>。想法是,你想制造一种随意的马奇。你们也希望马齐格的所有要点都能从所有其他方面得到。

如果你只是任意拆除了隔离墙,那么你的马齐格人很可能不会连接起来。回收回轨算法通过随机创建walk<>em>和拆除沿该随机行的隔离墙来予以考虑。休养背道部分使你能够步入马齐的每个牢房,即使你到达死端。

Answer 2

页: 1 通常,你应当这样做

If the current cell is the exit, then finished
If the current cell has any neighbours which have not been visited that are not walls
1. Choose randomly one of the unvisited non-wall neighbours
2. add the current cell to the stack
3. nothing
4. Make the chosen cell the current cell
5. Recursively call this function
else
1. remove the last current cell from the stack
2. Backtrack to the previous execution of this function

Answer 3

拆除隔离墙就意味着拆除隔离墙! 你们首先用一个囚室网,每座牢房都完全四座墙。当你随意走动(2.1)时,你将隔离墙带走。