Skip to Content
Mazes for Programmers
book

Mazes for Programmers

by Jamis Buck
July 2015
Intermediate to advanced
286 pages
6h 31m
English
Pragmatic Bookshelf
Content preview from Mazes for Programmers

Implementing the Binary Tree Algorithm

Let’s start with the Binary Tree algorithm. As you’ll recall from The Binary Tree Algorithm, it works simply by visiting each cell in the grid and choosing to carve a passage either north or east.

The following code does just that. We’re going to put it in its own class so that we can easily reuse this code whenever we want. Save it to a file named binary_tree.rb, and make sure it’s in the same directory as the cell.rb and grid.rb files we created earlier.

binary_tree.rb
Line 1 
class​ BinaryTree
def​ self.on(grid)
grid.each_cell ​do​ |cell|
neighbors = []
neighbors << cell.north ​if​ cell.north
neighbors << cell.east ​if​ cell.east
index = rand(neighbors.length)
10 
neighbor ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

AirBnbBlueOriginElectronic ArtsHomeDepotNasdaqRakutenTata Consultancy Services

QuotationMarkO’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
QuotationMarkI wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
QuotationMarkI’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
QuotationMarkI'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Mark W.
Embedded Software Engineer

You might also like

Math for Programmers

Math for Programmers

Paul Orland
Grokking Algorithms

Grokking Algorithms

Aditya Bhargava

Publisher Resources

ISBN: 9781680501315Errata Page