Final Rush Challenge

You are given a choice to survive in this maze that represents a board. Each right choice can change outcome or a wall. Each wrong choice leads to more a tile you can walk on. Given this maze with an unknown start coordinate and an unkown end coordinate return the number of steps required to reach the end coordinate from the start. The start square is located in row 0 and the end coordiante is located on the last row. If there is no possible path, then return null. You can move up, left, down, and right. You cannot move through walls. You cannot wrap around the edges of the board.

For example, given the following board:
[[t, t, t, f, t],
[t, t, t, f, f],
[f, f, f, t, f],
[f, t, f, f, f],
[f, f, t, t, t],
[t, f, t, t, t]]

Grid3-void