Pathery, silly

This idea may be just a waste of time, but it seems interesting enough to put to text.  At a trunk (a known valid state with any % of the walls placed so far) for each walkable square count the number of walkable neighbors (only walkable directions from itself).  Each square gains the value of it's own square plus the value of it's walkable neighbors.

All walkable squares then have a value between 2 and 20.  Values of x or lower are at high risk of blocking a path way.  Values greater then y are little risk of blocking a path.


Perhaps instead just count the eight sides from self, where the cardinal directions each are 1 point, and the corner may only be counted if either cardinal in that direction is open. ie: if n and w are blocked, then an open nw block doesn't provide this square a point due to not being accessible. If e is blocked, but s isn't, then se provides a point still.