It sounds like you want a pseudo-random space filling curve (for example, see Context-based Space Filling Curves -EUROGRAPHICS ’2000 (PDF format, 1.1 MB)) Take a look a Space-filling curve. I suspect you could apply some randomness to the construction of one of these to achieve what you want.
I present a greedy approach and it’s maybe close to the optimal (but I couldn’t find approximation factor). Idea is simple, we should block the cells which are in critical places of the Maze. These places can help to measure the connectivity of maze. We can consider the vertex connectivity and we find minimum vertex … Read more
It turns out there are 11 classic algorithms to generate “perfect” mazes. A maze is perfect if it has one, and only one, solution. Here are some links to each algorithm, in rough order of my preference. Kruskal’s Prim’s Recursive Backtracker Aldous-Broder Growing Tree Hunt-and-Kill Wilson’s Eller’s Recursive Division (Predictable) Sidewinder (Predictable) Binary Tree (Flawed) … Read more
You can think of your maze as a tree. A / \ / \ B C / \ / \ D E F G / \ \ H I J / \ L M / \ ** O (which could possibly represent) START + +—+—+ | A C G | +—+ + + + | … Read more
Here is a solution. Convert image to grayscale (not yet binary), adjusting weights for the colors so that final grayscale image is approximately uniform. You can do it simply by controlling sliders in Photoshop in Image -> Adjustments -> Black & White. Convert image to binary by setting appropriate threshold in Photoshop in Image -> … Read more