Timeline for Solving maze without return ability
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 5, 2011 at 2:39 | comment | added | munificent | Thanks, fixed! Yeah, now that I look at the requirements, the problem seems a little fishy. If you can't backtrack, the best you can hope for is a random walk. | |
| Aug 5, 2011 at 2:37 | history | edited | munificent | CC BY-SA 3.0 |
added 21 characters in body
|
| Aug 4, 2011 at 16:04 | comment | added | CiscoIPPhone |
I think if (path.contains(door)) continue; violates his requirements - the agent doesn't actually know if a door leads back to a room he's already been in unless he goes through the door.
|
|
| Aug 4, 2011 at 16:01 | comment | added | CiscoIPPhone |
I think escape(int startingRoom) should call escape(Stack<int> path)
|
|
| Aug 4, 2011 at 15:38 | history | answered | munificent | CC BY-SA 3.0 |