Maze Solver 

Assume you have a 2D array that represents a maze. Spaces are denoted by a 0 and walls are denoted by a 1. Devise the most efficient way to get through this maze, while following these two simple rules: 
- You can only move right (not left) 
- You can only move down (not up)