Procedural Maze Generator for Unity
Generate infinite, dynamic 3D mazes with full customization for roguelikes, puzzles, and escape games.

* This page contains affiliate links, meaning we may earn a small commission if you purchase something through them, at no extra cost. $5.50
- Category:
- Tools › Level-design
- Developer:
- Fizal
- Price:
- $5.50
- Favorites:
- 4
- Supported Unity Versions:
- 2022.3.48 or higher
- Current Version:
- 1.0
- Download Size:
- 107.66 KB
- Last Update:
- Mar 4, 2025
- Description:
- The Procedural Maze Generator creates unique, dynamic mazes with full customization. It's ideal for roguelikes, puzzles, escape rooms, and more! This package offers a range of features, including procedural generation, customizable settings, and optimized performance. It's designed to save time on level design and bring dynamic, replayable environments to your game.
Features:
Procedural Generation - Infinite maze variations at runtime or in the editor.
Customizable Settings - Control maze size, pathways, and complexity.
Optimized for Performance - Smooth, efficient generation for any platform.
Flexible Integration - Easily fits into any Unity project.
With this package, you can create unique mazes at runtime or in the editor, adjust maze size, complexity, and layout, and generate the same maze using a specific seed. It also supports different tile prefabs, runtime and editor support, and easy integration with any Unity project. - Technical Details:
- Procedural Generation - Creates unique mazes at runtime or in the editor.
Customizable Parameters - Adjust maze size, complexity, and layout.
Seed-Based Generation - Generate the same maze using a specific seed.
Optimized Performance - Efficient algorithms for smooth generation.
Grid-Based Structure - Easy integration with pathfinding and AI.
Supports Different Tile Prefabs - Use custom walls, floors, and decorations.
Runtime & Editor Support - Generate mazes dynamically or pre-build them.
Easy Integration - Works with any Unity project, from 3D games to VR. - Continue »