Given a set of rooms, each with a N, a S, an E, and a W exit/entrance to another of the rooms, create as simple a map as possible that graphically represents their connections.
The rooms in question are the level 3 rooms of the Watcher's Keep from the Baldur's Gate 2 Throne of Bhaal game. There is no need to play or search much; the rooms and their connections are neatly described here, where each room is represented by its ingame code = AR<4-digits unique room identifier>.
Further notes:
- The north is the top left corner. Alternatively, you may use SW/SE/NW/NE
- A few rooms only have N/S entrance/exit points
- An exit is not only associated with a room, but with an entrance to this room. (In the game, when going to an exit, you appear at a specific entrance to the next room, not in an arbitrary point in it).
- Two entrance/exits are not necessarily "mutual". If I go though an exit to a new room, and then step into the exit of where I spawned, it might not return me to the same place.
- There should be no "teleportation portals" in the result.
My intuition tels me this is not a plane graph, thus multiple levels should be used. I have constructed a solution atm which has all but one room located in the "0 level" in multiple rotations, and one room in the second level upside-down (antigravity?). The simpler the final design the better.
Please tell me if this needs any modification!
