Maze Solving Task

Executive Function Duration: ~10 minutes

System Requirements

🖥️

Screen Size:
Minimum: 800×600
Recommended: 1024×768

⌨️

Keyboard required

Description

A spatial reasoning and planning task requiring participants to solve mazes by finding the shortest path from start to finish. Uses Kruskal algorithm-generated mazes with guaranteed solutions.

Test Details

Test ID:

maze

Main File:

maze.pbl

Parameters:

0 configurable parameters

Languages:

German English Spanish French Italian Dutch Portuguese

🚀 Try Without Registration

Run this test immediately without creating an account. Data stays in your browser.

🎮 Try Demo (Quick Preview) 🔬 Configure No-Login Research Mode

Data Output

Output File:

mazesolving-{subnum}.csv

Format:

CSV

Data Columns

Column Name	Description
subnum	Participant ID
maze	Maze identifier or problem number
shortestpath	Length of the optimal shortest path from start to finish
totalmoves	Total number of moves made by participant
pathlength	Length of the actual path taken by participant
planningtime	Time spent in planning phase before first move (ms)
firstmovetime	Time from end of planning to first move (ms)
solutiontime	Time spent solving the maze after first move (ms)
totaltime	Total time from maze presentation to completion (ms)
moveseq	Sequence of moves made (encoded directional sequence)
bestseq	Optimal solution sequence for comparison

Scoring and Interpretation

Primary measures: Planning time (time before first move), path efficiency (pathlength/shortestpath ratio), solution accuracy (correct vs errors). Secondary measures: Total moves, solution time, backtracking events (from log file). Lower planning times with higher accuracy indicate better executive function and spatial planning ability.

Example Data

example-data.csv Primary

Trial-level data showing maze characteristics and performance metrics for each maze solved

subnum	maze	shortestpath	totalmoves	pathlength	planningtime	firstmovetime	solutiontime	totaltime	moveseq	bestseq
example-data	PRACTICE	9	9	9	1577	2126	1393	3519	1\|2\|3\|4\|9\|14\|15\|20\|25	1\|2\|3\|4\|9\|14\|15\|20\|25
example-data	9	57	61	57	3461	4113	14307	18420	1\|2\|17\|18\|33\|34\|35\|20\|5\|6\|21\|22\|37\|52\|67\|68\|53\|54\|55\|40\|25\|26\|41\|42\|57\|58\|73\|74\|89\|104\|103\|102\|101\|100\|115\|130\|145\|144\|129\|128\|143\|158\|159\|174\|175\|176\|191\|192\|177\|178\|163\|164\|179\|194\|209\|210\|225	1\|2\|17\|18\|33\|34\|35\|20\|5\|6\|21\|22\|37\|52\|67\|68\|53\|54\|55\|40\|25\|26\|41\|42\|57\|58\|73\|74\|89\|104\|103\|102\|101\|100\|115\|130\|145\|144\|129\|128\|143\|158\|159\|174\|175\|176\|191\|192\|177\|178\|163\|164\|179\|194\|209\|210\|225
example-data	1	49	50	49	1479	1916	12382	14298	1\|16\|31\|32\|33\|34\|35\|36\|37\|52\|53\|68\|83\|82\|97\|96\|81\|80\|79\|94\|109\|108\|123\|122\|137\|152\|167\|168\|183\|198\|213\|214\|215\|200\|201\|202\|187\|188\|189\|190\|191\|176\|177\|178\|193\|194\|209\|224\|225	1\|16\|31\|32\|33\|34\|35\|36\|37\|52\|53\|68\|83\|82\|97\|96\|81\|80\|79\|94\|109\|108\|123\|122\|137\|152\|167\|168\|183\|198\|213\|214\|215\|200\|201\|202\|187\|188\|189\|190\|191\|176\|177\|178\|193\|194\|209\|224\|225
example-data	10	47	71	69	4222	4497	21163	25660	1\|2\|3\|18\|19\|34\|49\|64\|63\|78\|93\|108\|109\|124\|125\|126\|111\|112\|127\|128\|113\|98\|99\|114\|129\|144\|145\|160\|159\|174\|173\|158\|157\|156\|157\|158\|173\|174\|159\|160\|145\|144\|129\|114\|99\|84\|69\|70\|71\|72\|87\|102\|117\|116\|131\|132\|147\|162\|177\|178\|193\|208\|207\|206\|221\|222\|223\|224\|225	1\|2\|3\|18\|19\|34\|49\|64\|63\|78\|93\|108\|109\|124\|125\|126\|111\|112\|127\|128\|113\|98\|99\|84\|69\|70\|71\|72\|87\|102\|117\|116\|131\|132\|147\|162\|177\|178\|193\|208\|207\|206\|221\|222\|223\|224\|225
example-data	13	55	60	55	9752	10063	12943	23006	1\|16\|31\|46\|47\|48\|49\|64\|65\|50\|51\|52\|53\|38\|39\|54\|69\|84\|99\|114\|113\|128\|127\|112\|111\|126\|141\|156\|155\|170\|185\|186\|171\|172\|173\|174\|159\|160\|161\|146\|131\|130\|115\|116\|117\|118\|119\|134\|149\|150\|165\|180\|195\|210\|225	1\|16\|31\|46\|47\|48\|49\|64\|65\|50\|51\|52\|53\|38\|39\|54\|69\|84\|99\|114\|113\|128\|127\|112\|111\|126\|141\|156\|155\|170\|185\|186\|171\|172\|173\|174\|159\|160\|161\|146\|131\|130\|115\|116\|117\|118\|119\|134\|149\|150\|165\|180\|195\|210\|225
example-data	19	45	87	77	2347	2857	25749	28606	1\|2\|3\|18\|33\|48\|47\|62\|77\|92\|93\|108\|109\|94\|109\|108\|93\|92\|107\|106\|121\|136\|151\|166\|167\|152\|153\|168\|153\|152\|137\|152\|167\|166\|151\|136\|121\|106\|107\|92\|93\|108\|109\|94\|95\|96\|81\|82\|97\|98\|113\|112\|127\|142\|141\|156\|171\|186\|201\|202\|203\|188\|189\|190\|205\|206\|221\|222\|207\|192\|193\|208\|209\|224\|209\|210\|225	1\|2\|3\|18\|33\|48\|47\|62\|77\|92\|93\|108\|109\|94\|95\|96\|81\|82\|97\|98\|113\|112\|127\|142\|141\|156\|171\|186\|201\|202\|203\|188\|189\|190\|205\|206\|221\|222\|207\|192\|193\|208\|209\|210\|225

mazesolving-log-example-data.csv Detail

Move-by-move log data showing every action and position during maze solving

subnum	maze	event	move	pos	x	y	abstime
example-data	maze	MOVE	[1	2]	880	435	7456
example-data	maze	MOVE	[1	3]	960	435	7672
example-data	maze	MOVE	[1	4]	1040	435	7885
example-data	maze	MOVE	[2	4]	1040	515	8065
example-data	maze	MOVE	[3	4]	1040	595	8238
example-data	maze	MOVE	[3	5]	1120	595	8468
example-data	maze	MOVE	[4	5]	1120	675	8647
example-data	maze	MOVE	[5	5]	1120	755	8849
example-data	JSON Object	MOVE	[1	2]	800	408	13864

View full file (333 rows) →

report-example-data.txt Summary

Human-readable text summary report of performance

Maze ID: 9
example-data Tue Nov 4 23:12:19 2025
Path succeeded? [1]
optimal path length: 57
number of moves: 61
Participant path length: 57
Planning Time: 3461
Time to first move: 4113
Solving Time: 14307
Total time: 18420

View full file (60 rows) →

Sample data showing typical output format. Actual values will vary by participant.

About This Test

A spatial reasoning and planning task requiring participants to solve mazes by finding the shortest path from start to finish. Uses Kruskal algorithm-generated mazes with guaranteed solutions.

Category: Executive Function
Estimated Duration: 10 minutes
Available Translations: 7 languages

Documentation Sources:
Test implementation, Parameter schema

Documentation Status: Minimal