I have quite a creative task with many, but a bit vague limitations. Can someone help me with it?
The solution should be not trivial for a person who is inside the maze. (The partitions are walls, higher than human hight.)
For example this maze is trivial, there is only one side path and you can investigate it even without walking - just look and see the dead end there:
The size is in-between 6x5 and 6x10. Lesser size - better.
You can change it to 14-20 other mazes (non-trivial and significantly different) by moving N or less wall fragments (of size 1). Lesser N - better.
The length of the shortest path between entry and exit should be the same in all mazes.
Harder to solve each maze - better:
5.1. More non-trivial circling paths - better.
5.2. More non-trivial side paths (dead ends) - better.
Any ideas (even unfinished) and help is appreciated.
P.S. Many people seems to misunderstand what I mean by 2D cell-based maze. I mean that you take rectangular piece of squared paper with 6xM cells inside, and draw only along the lines (cells borders). The drawings will be the walls, and the rest will be the voice space the solver can walk through. Exactly like 2 mentioned examples shown.