Skip to content


Subversion checkout URL

You can clone with
Download ZIP
Fetching contributors…
Cannot retrieve contributors at this time
executable file 313 lines (236 sloc) 9.28 KB
Generate maze layouts for 'pelita', without dead ends.
* start with an empty grid
* draw a wall with gaps, dividing the grid in 2
* repeat recursively for each sub-grid
* find dead ends
* remove a wall at the dead ends
Players 1,3 always start in the bottom left; 2,4 in the top right
Food is placed randomly (though not too close to the pacmen starting positions)
the final map includes a symmetric, flipped copy
the first wall has k gaps, the next wall has k/2 gaps, etc. (min=1)
Inspired by code by Dan Gillick
Completely rewritten by Pietro Berkes
import numpy
from mdp.graph import Graph
from pelita.datamodel import moves, north, south, east, west
# character constants for walls, food, and empty spaces
W = '#'
F = '.'
E = ' '
def empty_maze(height, width):
"""Return an empty maze with external walls.
A maze is a 2D array of characters representing walls, food, and agents.
An empty maze is made of empty tiles, except for the external walls.
maze = numpy.empty((height, width), dtype='c')
# add external walls
maze[0, :].fill(W)
maze[-1, :].fill(W)
maze[:, 0].fill(W)
maze[:, -1].fill(W)
return maze
def maze_to_str(maze):
"""Return string representation of maze."""
lines = [''.join(maze[i,:])
for i in range(maze.shape[0])]
return '\n'.join(lines)
def str_to_maze(str):
"""Return a maze array from a string representation."""
maze = numpy.array([list(ln.strip()) for ln in str.splitlines()
if len(ln.strip()) > 1])
return maze
def create_half_maze(maze, ngaps_center):
"""Fill the left half of the maze with random walls.
The second half can be created by mirroring the left part using
the 'complete_maze' function.
# first, we need a wall in the middle
# the gaps in the central wall have to be chosen such that they can
# be mirrored
ch = maze.shape[0] - 2
candidates = numpy.random.permutation(ch // 2)
half_gaps_pos = candidates[:ngaps_center // 2]
gaps_pos = []
for pos in half_gaps_pos:
gaps_pos.append(ch - pos - 1)
# make wall
_add_wall_at(maze, (maze.shape[1] - 2) // 2 - 1, ngaps_center,
vertical=True, gaps_pos=gaps_pos)
# then, fill the left half with walls
_add_wall(maze[:, :maze.shape[1] // 2], ngaps_center // 2, vertical=False)
def _add_wall_at(maze, pos, ngaps, vertical, gaps_pos=None):
add a wall with gaps
maze -- maze where to place wall, plus a border of one element
pos -- position where to put the wall whithin the center of the maze
(border excluded)
if not vertical:
maze = maze.T
center = maze[1:-1, 1:-1]
ch, cw = center.shape
# place wall
center[:, pos].fill(W)
# place gaps
ngaps = max(1, ngaps)
# choose position of gaps if necessary
if gaps_pos is None:
# choose random positions
gaps_pos = numpy.random.permutation(numpy.arange(ch)).tolist()
gaps_pos = gaps_pos[:ngaps]
# do not block entrances
if maze[0][pos + 1] == E:
gaps_pos.insert(0, 0)
if maze[-1][pos + 1] == E:
gaps_pos.insert(0, ch - 1)
for gp in gaps_pos:
center[gp, pos] = E
sub_mazes = [maze[:, :pos + 2], maze[:, pos + 1:]]
if not vertical:
sub_mazes = [sm.T for sm in sub_mazes]
return sub_mazes
def _add_wall(maze, ngaps, vertical):
"""Recursively build the walls of the maze.
grid -- 2D array of characters representing the maze
ngaps -- number of empty spaces to leave in the wall
vertical -- if True, create a vertical wall, otherwise horizontal
h, w = maze.shape
center = maze[1:-1, 1:-1]
ch, cw = center.shape
# no space for walls, interrupt recursion
if ch < 3 and cw < 3:
size = cw if vertical else ch
# create a wall only if there is some space in this direction
min_size = numpy.random.randint(3, 6)
if size >= min_size:
# place the wall at random spot
pos = numpy.random.randint(1, size - 1)
sub_mazes = _add_wall_at(maze, pos, ngaps, vertical)
# recursively add walls
for sub_maze in sub_mazes:
_add_wall(sub_maze, max(1, ngaps // 2), not vertical)
def walls_to_graph(maze):
"""Transform a maze in a graph.
The data on the nodes correspond to their coordinates, data on edges is
the actions to take to transition to that edge.
graph -- a Graph
nodes_dict -- a dictionary that maps coordinates into nodes
e.g. nodes_dict[(3,4)] == node that represents coord x=3,y=4
h, w = maze.shape
graph = Graph()
# define nodes for maze
nodes_dict = {}
for x in range(w):
for y in range(h):
if maze[y, x] != W:
nodes_dict[(x, y)] = graph.add_node((x, y))
directions = [west, east, north, south]
# add edges
for pos in nodes_dict:
for dir_ in directions:
neighbor = (pos[0] + dir_[0], pos[1] + dir_[1])
if nodes_dict.has_key(neighbor):
graph.add_edge(nodes_dict[pos], nodes_dict[neighbor],
return graph, nodes_dict
def find_dead_ends(graph, start_node, width):
"""Find dead ends in a graph."""
dead_ends = []
def collect_dead_ends(node):
x =[0]
# do not consider dead ends on the right side of the maze, as those
# represents passages to the enemy's side
if node.in_degree() == 1 and x < width - 1:
return dead_ends
def remove_dead_end(dead_node, maze):
"""Remove one dead end in a maze."""
h, w = maze.shape
pos =
free_dir = dead_node.get_edges_out()[0].data[0]
# first, try to pierce the wall straight ahead
# this might not be possible if we are on the borders of the maze
# this dictionary gives us the sequence of directions to try
free_to_pierce = {west: [east, north, south],
east: [west, north, south],
north: [south, west, east],
south: [north, west, east]
for pierce_dir in free_to_pierce[free_dir]:
pierce_x, pierce_y = pos[0] + pierce_dir[0], pos[1] + pierce_dir[1]
# remember not to pierce walls in the central wall (x==w-1), as those
# might become dead ends during the mirroring step
if (pierce_x >= 0 and pierce_x < w - 1
and pierce_y >= 0
and pierce_y < h):
maze[pierce_y, pierce_x] = E
def remove_all_dead_ends(maze):
height, width = maze.shape
while True:
maze_graph, maze_nodes = walls_to_graph(maze[1:height - 1,
1:width // 2])
start_node = maze_nodes.values()[0]
dead_ends = find_dead_ends(maze_graph,
start_node, width // 2 - 1)
if len(dead_ends) == 0:
remove_dead_end(dead_ends[0], maze[1:height - 1, 1:width // 2])
def add_pacman_stuff(maze, max_food):
"""Add PacMen and food. """
h, w = maze.shape
## starting pacmen positions
maze[-2, 1] = '2'
maze[-3, 1] = '0'
maze[1, -2] = '3'
maze[2, -2] = '1'
## random food
total_food = 0
while total_food < max_food:
row = numpy.random.randint(1, h - 1)
col = numpy.random.randint(1, (w // 2) - 1)
if (row > h - 6) and (col < 6): continue
if maze[row, col] == E:
maze[row, col] = F
maze[h - row - 1, w - col - 1] = F
total_food += 2
def get_new_maze(height, width, nfood=30, seed=None, dead_ends=False):
"""Create a new maze in text format.
The maze is created with a recursive creation algorithm. The maze part of
the blue team is a center-mirror version of the one for the red team.
The function reserves space for 2 PacMan for each team in upper-right
and lower-left corners of the maze. Food is added at random.
Input arguments:
height, width -- the size of the maze, including the outer walls
nfood -- number of food dots for each team
seed -- if not None, the random seed used to generate the maze
dead_ends -- if False, remove all dead ends in the maze
if seed is None:
seed = numpy.random.randint(1, 2 ** 31 - 1)
maze = empty_maze(height, width)
create_half_maze(maze, height // 2)
# make space for pacman (2 pacman each)
maze[-2, 1] = E
maze[-3, 1] = E
# remove dead ends
if not dead_ends:
# complete right part of maze with mirror copy
maze[:, width // 2:] = numpy.flipud(numpy.fliplr(maze[:, :width // 2]))
# add food and pacman
add_pacman_stuff(maze, max_food=2 * nfood)
return maze_to_str(maze)
Jump to Line
Something went wrong with that request. Please try again.