X-Git-Url: https://jxself.org/git/?p=open-adventure.git;a=blobdiff_plain;f=newdungeon.py;h=60625997f907ddc4976fd39b1ce406f5d546637f;hp=0575d2c8b3afad7a03812f1482244d1f11d70077;hb=3b780dd57e295b57ba78649e008fede10e07cdd9;hpb=4f6bc949bd13c8028bad1acec4b17fe189f11872 diff --git a/newdungeon.py b/newdungeon.py index 0575d2c..6062599 100755 --- a/newdungeon.py +++ b/newdungeon.py @@ -3,8 +3,48 @@ # This is the new open-adventure dungeon generator. It'll eventually # replace the existing dungeon.c It currently outputs a .h and .c pair # for C code. - -import yaml +# +# The nontrivial part of this is the compilation of the YAML for +# movement rules to the travel array that's actually used by +# playermove(). This program first compiles the YAML to a form +# identical to the data in section 3 of the old adventure.text file, +# then a second stage unpacks that data into the travel array. +# +# Here are the rules of the intermediate form: +# +# Each row of data contains a location number (X), a second +# location number (Y), and a list of motion numbers (see section 4). +# each motion represents a verb which will go to Y if currently at X. +# Y, in turn, is interpreted as follows. Let M=Y/1000, N=Y mod 1000. +# If N<=300 it is the location to go to. +# If 300500 message N-500 from section 6 is printed, +# and he stays wherever he is. +# Meanwhile, M specifies the conditions on the motion. +# If M=0 it's unconditional. +# If 0