Mazes for Programmers: Code Your Own Twisty Little Passages by Jamis Buck

Author:Jamis Buck [Buck, Jamis]
Language: eng
Format: epub, azw3, pdf
Tags: Pragmatic Bookshelf
ISBN: 9781680500554
Publisher: Pragmatic Bookshelf
Published: 2015-07-14T22:00:00+00:00

RecursiveBacktracker.on(grid)

grid.to_png.save('hex.png')

Running it, you ought to get something like this figure. Very nice! It’s definitely working as we wanted. Experiment a bit with some other maze algorithms and see what you get, but be careful with Binary Tree and Sidewinder! These two need a bit of babysitting.

To understand why, recall The Binary Tree Algorithm. For each cell, we choose between north and east to decide which neighbor to link, but in the case of a hexagon grid, cells have no eastern neighbor. The best we have are northeast, and southeast. Similarly, Sidewinder wants to choose an eastern neighbor but will also be foiled by our new geometry. So what do we do?

Well, neither of those algorithms actually wants “east.” What they really want is “the cell in the same row, in the next column over.” On a regular grid, that just happens to be east. For a hex grid, that will be either northeast or southeast, depending on the current column, but we don’t even need to worry about that. We took care of the row/column assignments when we set up the grid. To get the neighbor in the next column over, we can just use our array accessor, like this:

east = grid[cell.row, cell.column+1]

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.