module to create Zork like game maps?

[Eli the Bearded]

[note crosspost and follow-ups]

I've tried searching CPAN, but found only one module related to games
and maps, a line of sight calculator. That's not what I'm looking for.
What I am looking for is something to help either draw maps and/or
calculate the moves to get from room A to room B in a Zork (etc) map.
These are connected boxes with eight common directions (north,
northeast, east, southeast, south, southwest, west, northwest) and an
assortment of rarer directions (up, down, in, out, etc). In a few odd
cases the corridors are not straight, and leaving by west from one room
will enter you by south in another. It is often useful to note room names
and items of note in the rooms.

I'm not sure what interface I'd like best to use, but I have a number
of paper maps I want to transfer. Transfering by automatic parsing of
room names and exit directions (when possible, ie unique names and
regular directions) would be nice.

The only thing I've found so far in perl is "informap" from the IF
archive. It draws maps based on reading in game source code, which is
not an option for me.

Anybody know of perl code to help me?

Elijah
------
surprised more game mapping programs aren't out there

[Tad McClellan]

[ note trimmed follow-ups ]


Eli the Bearded <*@eli.users.panix.com> wrote:

> Anybody know of perl code to help me?

Nope, sorry.

> Elijah

But its nice to see you here again!


--
Tad McClellan SGML consulting
[email]tadmc@augustmail.com[/email] Perl programming
Fort Worth, Texas

[Abigail]

Eli the Bearded (*@eli.users.panix.com) wrote on MMMMCCCXIII September
MCMXCIII in <URL:news:eli$0506221606@qz.little-neck.ny.us>:
`` [note crosspost and follow-ups]
``
`` I've tried searching CPAN, but found only one module related to games
`` and maps, a line of sight calculator. That's not what I'm looking for.
`` What I am looking for is something to help either draw maps and/or
`` calculate the moves to get from room A to room B in a Zork (etc) map.
`` These are connected boxes with eight common directions (north,
`` northeast, east, southeast, south, southwest, west, northwest) and an
`` assortment of rarer directions (up, down, in, out, etc). In a few odd
`` cases the corridors are not straight, and leaving by west from one room
`` will enter you by south in another. It is often useful to note room names
`` and items of note in the rooms.


Calculating a path from one room to another is a standard graph
algorithm (Eulers algorithm will do fine). In the Graph::* modules
found on CPAN, there's something to help you out.



Abigail
--
map{${+chr}=chr}map{$_=>$_^ord$"}$=+$]..3*$=/2;
print "$J$u$s$t $a$n$o$t$h$e$r $P$e$r$l $H$a$c$k$e$r\n";