Unlock the secrets to creating random mazes Whether youre a game developer an algorithm connoisseur or simply in search of a new puzzle youre about to level up. Learn algorithms to randomly generate mazes in a variety of shapes sizes and dimensions. Bend them into Moebius strips fold them into cubes and wrap them around spheres. Stretch them into other dimensions squeeze them into arbitrary outlines and tile them in a dizzying variety of ways. From twelve little algorithms youll discover a vast reservoir of ideas and inspiration. From video games to movies mazes are ubiquitous. Explore a dozen algorithms for generating these puzzles randomly from Binary Tree to Ellers each copiously illustrated and accompanied by working implementations in Ruby. Youll learn their pros and cons and how to choose the right one for the job. Youll start by learning six maze algorithms and transition from making mazes on paper to writing programs that generate and draw them. Youll be introduced to Dijkstras algorithm and see how it can help solve analyze and visualize mazes. Part 2 shows you how to constrain your mazes to different shapes and outlines such as text circles hex and triangle grids and more. Youll learn techniques for culling deadends and for making your passages weave over and under each other. Part 3 looks at six more algorithms taking it all to the next level. Youll learn how to build your mazes in multiple dimensions and even on curved surfaces. Through it all youll discover yourself brimming with ideas the best medicine for programmers block burnout and the grayest of days. By the time youre done youll be energized and full of mazerelated possibilities What You Need The example code requires version 2 of the Ruby programming language. Some examples depend on the ChunkyPNG library to generate PNG images and one chapter uses POVRay version 3.7 to render 3D graphics.