> Thanks but how can I determine the size of maze (weight and height)?

> On Jul 6, 5:10 pm, "João Eduardo Ferreira Bertacchi"
> <joaobertac...@gmail.com> wrote:
>> On Sun, Jul 6, 2008 at 11:08 AM, João Eduardo Ferreira Bertacchi<joaobertac...@gmail.com> wrote:
>> > I did somewhat different. Every time I find a W it means that the
>> > current room (before walking) has no "front" wall and that the next
>> > room has no "back" wall. Front and back depends on the orientation of

>> the "person" that walks through the maze.

>> > On Sun, Jul 6, 2008 at 9:58 AM, ortschun <ortsch...@hotmail.com> wrote:

>> >> I have a question about this problem. Do I have to try turning left in
>> >> every point of the room? Moreover, could you please give me a little
>> >> spoiler about the algorithm?

>> >> On Jul 5, 7:40 pm, trss <trs...@gmail.com> wrote:
>> >>> guess i made a silly mistake in the eg i gave. like there is a loop
>> >>> and hence 2 paths between any 2 rooms in the loop (consisting of 8
>> >>> rooms leaving out the centre room). anyway, i now "guess" it can be
>> >>> concluded that all rooms will be explored by either/both paths but
>> >>> have to give further thought to be sure.

>> >>> On Jul 5, 9:04 pm, trss <trs...@gmail.com> wrote:

>> >>> > how come? is it specified in the problem statement? if it is rule 3 gn
>> >>> > below from which it is concluded, it just says about the maze but not
>> >>> > the path.

>> >>> > 3.      There is exactly one path between any two rooms in the maze (that
>> >>> > is, exactly one path that does not involve backtracking).

>> >>> > for eg, consider the following maze
>> >>> > ae7
>> >>> > 313
>> >>> > bc5
>> >>> > (hope it is wat i mean)
>> >>> > here, the input will be WWWRWWLW WWWRWWLW both of which dont explore
>> >>> > the centre room connected to north room to it and hence to every other
>> >>> > room satisfying condition 3.

>> >>> > On Jul 4, 9:49 pm, Rajat <ag.raja...@gmail.com> wrote:

>> >>> > > You can be sure that you have explored every bit of the maze. :)

>> >>> > > On Jul 4, 8:40 pm, escobar5 <jsescob...@gmail.com> wrote:

>> >>> > > > Hello,

>> >>> > > > i have a doubt,

>> >>> > > > if i take both paths in a perfect maze (start-end, end-start) can i be
>> >>> > > > sure i covered all of its columns and all of its rows?

>> >>> > > > or can i have a path where i don´t go through all of its columns and
>> >>> > > > rows?

>> >>> > > > Thanks

>> > --
>> > Abraços,

>> > ==================
>> > João E. F. Bertacchi
>> >www.repsubmarino.com

>> --
>> Abraços,

>> ==================
>> João E. F. Bertacchiwww.repsubmarino.com