Programming Noob

less info
264 reputation
26
bio website
location
age
visits member for 2 years, 4 months
seen Apr 27 '13 at 1:04

Apr
24
comment The Wikipedia animation for Maze generation using DFS isn't consistent wrt the written algorithm given there, isn't it?
Ok I think I got it. The animation there assumes the cells adjacent to the cell under consideration as it's 'walls'. I thought a 'wall' was the common edge between two adjacent cells...
Apr
24
comment The Wikipedia animation for Maze generation using DFS isn't consistent wrt the written algorithm given there, isn't it?
I understand what you say about backtracking to the last cell with an unvisited neighbor, so after reaching (7,3) it must back track to (6,3) and (6,3) still has unvisited neighbors - which are (6,4) and (6,2) right? So why is the next cell chosen after (7,3), (4,5)? Sorry if this is confusing lol. Tell me if you didn't get anything..
Apr
24
comment The Wikipedia animation for Maze generation using DFS isn't consistent wrt the written algorithm given there, isn't it?
It hits a dead end at (1,5)? Are we both looking at the right video? link The maze has progressed far beyond (1,5) by time 0:03.. And from the image that I gave the link to, it appears as if the first decision is taken when the red square reaches (7,3) and the traversal path is: (1,1) (1,2) (1,3) (2,3) (3,3) (3,2) (3,1) (4,1) (5,1) (6,1) (7,1) (8,1) (9,1) (9,2) (9,3) (9,4) (9,5) (8,5) (7,5) (6,5) (5,5) (5,4) (5,3) (6,3) (7,3)