EPTOn June 10 2009 05:08 Daveed wrote:
@Muirhead:
Although it needs to keep only one maze in its head at a time, it also needs to know which maze it's on, in order to generate the next maze in its enumeration (that IS what you are doing, correct?).
@Muirhead:
Although it needs to keep only one maze in its head at a time, it also needs to know which maze it's on, in order to generate the next maze in its enumeration (that IS what you are doing, correct?).
I wrote:
As for memory constraints, you require (m x n) bits to store any one maze.
That should read, (m x n) bits to keep track of the maze you are on. Simply increment the bits to look at the next maze. The information encoding IS the structure it represents (let every 1 be a wall, 0 non-wall).
