: Systems that model a dungeon as a Key-Lock-Reward structure.
: Designers use solvers to verify that randomly generated dungeons are actually beatable. For example, Satisfiability Modulo Theories (SMT) solvers can ensure that rooms are placed legally without intersecting. Dungeon Solver
A measure of how efficiently rooms and connections are laid out, often checked during the "printing" or graphing phase of a solver. : Systems that model a dungeon as a