Generates synthetic maze navigation tasks where a path must be found from a green start position to a red flag end position through a grid maze with walls and pathways.

Each sample pairs a task (first frame + prompt describing what needs to happen) with its ground truth solution (final frame showing the result + video demonstrating how to achieve it). This structure enables both model evaluation and training.

# Clone the repository
git clone https://github.com/VBVR-DataFactory/O-39_maze_data-generator.git
cd O-39_maze_data-generator

# Install dependencies
pip install -r requirements.txt

# Generate 100 samples
python examples/generate.py --num-samples 100

# Generate with specific seed
python examples/generate.py --num-samples 100 --seed 42

# Generate without videos
python examples/generate.py --num-samples 100 --no-videos

# Custom output directory
python examples/generate.py --num-samples 100 --output data/my_output

The scene shows a 15×15 grid maze with dark walls and white pathways. A green circular marker indicates the starting position, and a red flag marks the end position. Starting from the green start position, navigate through the maze by moving along the white pathways. You can move to adjacent cells (up, down, left, right) but cannot pass through the dark walls. The goal is to find and demonstrate the complete path from the green start to the red flag end position, showing each step of the journey through the maze.

Initial Frame Maze with start (green) and end (red flag)	Animation Path being traced through maze	Final Frame Complete solution path shown

Find and demonstrate a valid path from the start position to the end position in a grid-based maze, navigating only through open pathways while avoiding walls.

• Maze Size: 15×15 grid
• Start Marker: Green circular marker at starting cell
• End Marker: Red flag at goal cell
• Walls: Dark colored cells that block passage
• Pathways: White cells that allow movement
• Movement: Can move to adjacent cells (up, down, left, right)
• Difficulty Levels: Easy, medium, or hard mazes

• Pathfinding: Tests ability to find valid routes in constrained space
• Obstacle avoidance: Requires navigating around walls
• Goal-directed navigation: Must reach specific target location
• Step-by-step solution: Animation shows complete path from start to end
• Grid-based movement: Discrete cell-to-cell navigation
• Valid path constraint: Can only move through pathways, not walls
• Visual clarity: Clear distinction between walls, pathways, start, and end

data/questions/maze_task/maze_00000000/
├── first_frame.png      # Initial state (maze with start and end markers)
├── final_frame.png      # Final state (solution path shown)
├── prompt.txt           # Task instructions
├── ground_truth.mp4     # Solution video (16 fps)
└── question_metadata.json # Task metadata

File specifications: Images are 1024×1024 PNG. Videos are MP4 at 16 fps, duration varies by path length.

pathfinding maze-navigation obstacle-avoidance goal-directed grid-search spatial-planning route-finding