csherin/mazes — Issue #7: Help the reader with recursive_backtracker
Author: PragTob
Created: 2012-01-20 19:15:47+00:00
State: open

As this (maze generation) is something that I'm not too familiar with I'd like a comment describing the algorithm(in `find_path_from(cx, cy)`) a bit (or more expressive code, though I dunno if can get expressive enough for me to understand it easily =) ). Especially I'd like to know what the point n and the point c stand for, more descriptive names of possible could be useful.