2 ms·
Yeah, I'm aware of graph data structures. I tried creating a map like that too. It ended up a big mess of nodes with all of these edges intersecting each other
by chongli 10y ago
Yeah, I'm aware of graph data structures. I tried creating a map like that too. It ended up a big mess of nodes with all of these edges intersecting each other and looping back around. I might have made a mistake or two and that screwed up the graph even more! It drove me crazy with how tedious it was.
I guess I reached a point where I said "this is just too complex, it can't be the right solution, there's got to be a smarter way to do this". So to find out that there isn't a smarter way just makes me think it's a terrible puzzle design.
- rsaarelm 10y agoIt is terrible puzzle design. Zork is old.
- CPLX 10y agoI solved it with a pencil and paper when I was 12 years old or so, and I'm pretty sure lots of other people did too. I agree it's a little tedious by modern standards but it's really not that complicated. If I recall correctly you can represent the entire thing with about 5-10 boxes connected by a couple lines between them plus a bunch of little loops where the player remains in the same place. It's a succinct area of the map. Perhaps you should try again with a fresh perspective.
- pimlottc 10y agoHere's an example of a map like that [0] I made a while ago for an online game. Each room, uniquely identified by an arbitrary item (bagel, lantern, longsword, loaf of bread, etc), is drawn separately with lines in each of the four cardinal indicating where those exits end up. Some are indicated as one-way passages, while others are bent to indicate some sort of spatial relationship when it's reasonable to show (though the entire maze has no coherent planar form). Rooms are in rough order of distance from the end of the maze, which starts at "RED" (through the one-way passage from "FT") and ends at "BREAD" with the east exit back to "FT". Of course, this is a cleaned up version once I had discovered all the connections; while mapping, each passage would be drawns as a straight one-way connection until bi-directional relationships were discovered. The chart on the bottom shows the same maze in the form of an adjacency matrix, showing which rooms are connected to which, and by which direction. Again, the rooms are banded by number of steps from the exit. Note that pairs of rooms with bi-directional connections can be discovered by noticing filled cells whose positions are symmetrical about the diagonal of the chart. The 3 x 3 square in the upper corner is a sort of simple compass I came up with for navigating the maze; it tells you which way to go based on the "shape" (i.e. which directions have exists) of the room. Even though not all room shapes are unique, if you follow those directions you are guaranteed to get out relatively quickly. 0: http://imgur.com/a/2SE8A http://imgur.com/a/2SE8A