It impossible because the 4 corner rooms only have 3 doors. If you went in and out of a corner room, you would be stuck if you entered that room again.
Printable View
It impossible because the 4 corner rooms only have 3 doors. If you went in and out of a corner room, you would be stuck if you entered that room again.
this is an adaptation of the bridges problem which started graph theory...basically it is impossible, as the degree of the vertexes (rooms) is odd in each case, and to have a closed eulerian trail through the graph mapped by the problem, the degrees must all be even.
If you didn't care where you finished, you could have at most 2 which were odd degree, but again, the others would have to be even.
Damn. I spent 3 hours trying to solve this and I usually get 9 doors.
are you allowed to walk on the outside of the structure?
nvm... it cant be done! odd amount of doors = always 2 doors left untouched
Yes, I think... :huh:Quote:
Originally posted by Infested Cats@3 April 2003 - 09:54
are you allowed to walk on the outside of the structure?
Where did you get it?
Sabrina in KLchat got it off her maths teacher :P
it is impossible,with two rooms with three doors each, you can never enter and exit a room to get to the other.
hmmm yep ive looked at it too and i think that it is impossible - not gonna happen not ever not :lol:
It is possible, if you believe in God.
God can do anything. I hear he can create a stick, with only one end. Dispute this, then you dispute God, literally sayning God CAN'T do anything.