An ES6 solution to the challenge: enumerate all configurations of walls within a 4 x 4 grid that would result in a valid maze. In a valid maze, 1. any space must be reachable from any other space and 2. there must be only one path between any two spaces in the maze. This solution can handle up to a 5 x 5 grid.