#include <stdlib.h>
#include <stdio.h>
#include <global.h>
#include <maze_gen.h>
#include <time.h>

Include dependency graph for maze_gen.cpp:

Data Structures
struct	free_walls_struct
	Contains free walls in the map. More...

Functions
static void	fill_maze_full (char *maze, int x, int y, int xsize, int ysize, free_walls_struct free_walls)
	Recursive routine which will fill every available space in the maze with walls. More...

static void	fill_maze_sparse (char *maze, int x, int y, int xsize, int ysize, free_walls_struct free_walls)
	Recursive routine which will fill much of the maze, but will leave some free spots (possibly large) toward the center. More...

static int	find_free_point (char *maze, int x, int *y, int xc, int yc, int xsize, int ysize)
	Randomly look for a square adjacent to this one where we can place a new block without closing a path. More...

static void	make_wall_free_list (int xsize, int ysize, free_walls_struct *free_walls)
	Inits the list of points where we can put walls on. More...

char **	maze_gen (int xsize, int ysize, int option, int _unused_layers)
	This function generates a random blocked maze with the property that there is only one path from one spot to any other, and there is always a path from one spot to any other. More...

static void	pop_wall_point (int x, int y, free_walls_struct *free_walls)
	Randomly returns one of the elements from the wall point list. More...

Detailed Description

General maze generator.

Author: peter.nosp@m.m@la.nosp@m.ngmui.nosp@m.r.ee.nosp@m.cs.be.nosp@m.rkel.nosp@m.ey.ed.nosp@m.u

Definition in file maze_gen.cpp.

Function Documentation

◆ fill_maze_full()

static void fill_maze_full	(	char **	maze,
		int	x,
		int	y,
		int	xsize,
		int	ysize,
		free_walls_struct *	free_walls
	)

static

Recursive routine which will fill every available space in the maze with walls.

Parameters

maze	maze.
x
y	where to put a wall.
xsize
ysize	maze size.
free_walls	free walls list.

Definition at line 301 of file maze_gen.cpp.

References find_free_point(), pop_wall_point(), RANDOM, and free_walls_struct::wall_free_size.

Referenced by maze_gen().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ fill_maze_sparse()

static void fill_maze_sparse	(	char **	maze,
		int	x,
		int	y,
		int	xsize,
		int	ysize,
		free_walls_struct *	free_walls
	)

static

Recursive routine which will fill much of the maze, but will leave some free spots (possibly large) toward the center.

Parameters

maze	maze.
x
y	where to put a wall.
xsize
ysize	maze size.
free_walls	free walls list.

Definition at line 334 of file maze_gen.cpp.

References find_free_point(), pop_wall_point(), RANDOM, and free_walls_struct::wall_free_size.

Referenced by maze_gen().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find_free_point()

static int find_free_point	(	char **	maze,
		int *	x,
		int *	y,
		int	xc,
		int	yc,
		int	xsize,
		int	ysize
	)

static

Randomly look for a square adjacent to this one where we can place a new block without closing a path.

We may only look up, down, right, or left.

Parameters

	maze	current maze.
[out]	x
[out]	y	coordinates of the found point.
	xc
	yc	coordinates from where to look.
	xsize
	ysize	maze size.

Returns: -1 if no free spot, 0 else.

Definition at line 192 of file maze_gen.cpp.

References RANDOM.

Referenced by fill_maze_full(), and fill_maze_sparse().

Here is the caller graph for this function:

◆ make_wall_free_list()

static void make_wall_free_list	(	int	xsize,
		int	ysize,
		free_walls_struct *	free_walls
	)

static

Inits the list of points where we can put walls on.

The free wall points are those outer points which aren't corners or near corners, and don't have a maze wall growing out of them already.

Parameters

xsize
ysize	size of the map.
free_walls	structure to initialise. free_walls_struct::wall_free_size must be initialised.

Definition at line 121 of file maze_gen.cpp.

References free_walls_struct::wall_free_size, free_walls_struct::wall_x_list, and free_walls_struct::wall_y_list.

Referenced by maze_gen().

Here is the caller graph for this function:

◆ maze_gen()

char** maze_gen	(	int	xsize,
		int	ysize,
		int	option,
		int	_unused_layers
	)

This function generates a random blocked maze with the property that there is only one path from one spot to any other, and there is always a path from one spot to any other.

Parameters