Neighbour-Walk Algorithm

This is a random-walk style algorithm intended to create a fixed-room-size dungeon akin to the Binding of Isaac. In essence, a starting node is picked from the center of the dungeon (highlighted in green at [4,4]) and each neighbour added to a stack. Every neighbour will be popped from the stack and evaluated for their validity and, upon successful validation, will add their neighbours recursively until the maximum room count is reached.