I had a brief look. I would define a maze datastructure and then a bunch of functions that create instances of this datastructure. Then write a function that, given a dc renders a maze instance. This is much more in the functional style.
HTH, N. On Sat, Jan 22, 2011 at 1:32 AM, Alexandre Moreira <[email protected]> wrote: > Hello, everyone. I've been studying scheme for some time now and I > decided to start writing meaningful, simple, applications with racket > to experiment and get some experience. I decided to go on tackling the > simple feat of maze generating. Of course, without knowing much of the > language, I decided to start on the simplest algorithm I could > conceive: recursive backtracking/depth first search. > ... _________________________________________________ For list-related administrative tasks: http://lists.racket-lang.org/listinfo/users
