Lazarus Mazes demo: Difference between revisions
From Free Pascal wiki
Jump to navigationJump to search
(Lazarus Mazes demo - new page added) |
(Screen shots added) |
||
| Line 1: | Line 1: | ||
== About == | == About == | ||
The program below gives a demonstration of how a maze can be created with Lazarus. The maze generation is based on a depth-first backtracking implementation[http://en.wikipedia.org/wiki/Maze_generation_algorithm#Depth-first_search]. As a little bonus a simple solver is implemented that shows a route from the start of the maze to the exit. | The program below gives a demonstration of how a maze can be created with Lazarus. The maze generation is based on a depth-first backtracking implementation[http://en.wikipedia.org/wiki/Maze_generation_algorithm#Depth-first_search]. As a little bonus a simple solver is implemented that shows a route from the start of the maze to the exit. | ||
Changing maze metrics: | |||
[[Image:mazedemo1.png]] | |||
The solver in action: | |||
[[Image:mazedemo2.png]] | |||
Revision as of 15:45, 18 November 2012
About
The program below gives a demonstration of how a maze can be created with Lazarus. The maze generation is based on a depth-first backtracking implementation[1]. As a little bonus a simple solver is implemented that shows a route from the start of the maze to the exit.
Changing maze metrics:
The solver in action:
