The file dd.pl
contains the following facts, which define the world of
this game.
These describe 11 caves called a to k, some of which are
connected. I write b meets a to mean that there is a passage directly
connecting
b and a; so you can get from b to a, and also from a to b.
Please draw a map of all the caves and their connections. You can
view the file by doing showlib dd.pl from Prolog.