The BFS solver, step by step
The thesis checks every floor with an exact breadth-first search (BFS). It turns a floor into a graph of nodes (monsters, doors and merged groups of items) and searches over the sets of nodes the hero has cleared. Every state is a cleared set with the hero's HP, attack, defence and keys. Step through the search and watch which states it keeps.
The search runs in your browser. On the complex floor and hand03 it takes minutes and a lot of memory, so those two show the stored result of the same search instead.
Exact search. States are taken in order of decisions (breadth first), most HP first. A set of cleared monsters and doors is expanded again only if a later state reaches it with more HP, so no better route is thrown away.
Published search. The solver released with the test maps keeps the first state it takes for each set. On this floor both find 13 HP; on the complex floor the published search reports 22 HP and the exact search 68.