Abstract Somemazesare more difficult to 80lve tban odJ.ermazes. For this reason. we develop a method by which the difficulty of amazecan be quantified, In the poc:ess we determine a way in \Wich thecomplexityof the hallways in amaze, which is the degree to which amazehas short aod quick twists aod turns. can also be measured. We use the variouscomplexitymeasures of the hallways in ...
Mar 1, 2025 ·Thus, procedural generation-based games have to rely on constrained heuristics that guarantee, one way or another, the feasibility of the generated levels and usually use brute-force techniques to increase thecomplexityof the successive levels during game-play, for instance, resorting to increasedmazedimensions.
Additionally, I will be using Gabrovšek’s method of employingmazesolving agents to deter-minemazedificulty andcomplexity[2]. I will be adding additional agents however, including heuristic searches, such as A* search, greedy, etc. for more accurate measures as to how a computer may solve amazeas well as how to push the model further.
Themazes complexitywas defined by the dead ends, visited intersections, and the average steps taken to solve by four diferent search algorithms. The team decided to use the ”Recursive Backtracking” method for the creation of themazein this project for its relative simplicity and speed, while still being able to createcomplexstructures.
