Mazes

[borntofrappe]

Explore different algorithms to create mazes, starting from the book "Mazes for Programmers"

[borntofrappe]

This project is mostly to learn about different algorithms, but the potential for a game is there. For the first two demos, for instance, I've decided to include a circle representing the player, and have its position constrained by the surrounding gates (see screen capture below).

[borntofrappe]

Update: (with a different color palette) I created two additional demos. One explores a simplified version of Dijkstra's algorithm, in order to map the distance between a selected cell and any other point in the grid; one implments the Aldus-Broder algorithm.

Props for using the Timer utility developed for the Petri dish folder. Staggering the progress of the two algorithms works to illustrate how both work.

[borntofrappe]

Up next, three more algorithms

• WIlson (unbiased, similar to Aldus-Broder)
• Hunt and Kill
• recursive backtracker

Based on these demos I might develop a basic game where you are tasked to move from point to point in a given number of steps.

[borntofrappe]

Finished the algorithms introduced in the first part of the quoted book. The issue can be closed with this update, but I might develop a small game starting from these foundations.