Mazes for Programmers/

...

/

Implementing a Mask

Implementing a Mask

Learn to create a Mask class that will encapsulate the on-off state of each cell in our grid.

We'll cover the following...

The Mask class

Let’s create a Mask class that will encapsulate the on-off state of each cell in our grid. That is to say, for each cell in the grid, our mask should be able to tell us whether or not it should be included in the maze. The following implementation does this by keeping a separate two-dimensional array of Boolean values, where false means the corresponding cell is “off the grid.” Let's look at the code below.

Press + to interact
class Mask
  
  attr_reader :rows, :columns
  def initialize(rows, columns)
    @rows, @columns = rows, columns
    @bits = Array.new(@rows) { Array.new(@columns, true) }
  end
  def [](row, column)
    if row.between?(0, @rows - 1) && column.between?(0, @columns - 1)
      @bits[row][column]
    else
      false
    end
  end
  def []=(row, column, is_on)
    @bits[row][column] = is_on
  end
  def count
    count = 0
    @rows.times do |row|
      @columns.times do |col|
        count += 1 if @bits[row][col]
      end
    end
    count
  end
  def random_location
    loop do
      row = rand(@rows)
      col = rand(@columns)
      return [row, col] if @bits[row][col]
    end
  end
end

Code explanation

Lines 5–8: The initialize constructor is pretty straightforward, just recording the dimensions of the mask and creating a two-dimensional array of Boolean values, indicating which cells are on (enabled) and which are off (disabled).

Lines 10–20: These two methods query and modify ...