I have recently challenged myself to make a maze generator using depth first search (with which I have zero experience) and I have a function which will be called a bunch for checking if the neighbors of a point in a 2d list are vallid and unvisited. I have my own system for notation of connections in a 2d network so just know that 0s unvisited locations.