Maze-Solving Task

The Maze-Solving Task assesses spatial reasoning, planning, and navigation abilities using randomly generated mazes created with the Kruskal algorithm. Participants navigate from a marked start position (S) to an end position (E) using arrow keys to move through the maze corridors. The task allows optional planning time before the first move and tracks both planning time and solution time. Performance is measured by comparing the participant's path length and number of moves to the optimal (shortest) solution path. Standard 15x15 mazes can be used from a cached set for consistency across participants, or new mazes can be randomly generated. This task is useful for studying spatial problem-solving, executive function, planning strategies, and individual differences in navigation approaches.
