Overview

Mazes are a great introduction to graph-based pathfinding algorithms, as the entire graph is visualized and the state space is relatively small.

Actions

[ left/right, up/down ]

action[0] (left/right)

• -1: left
• 0: /
• 1: right

action[1] (up/down)

• -1: up
• 0: /
• 1: down

Input

[ “grid”, “your_position” ]

End Condition

Additional Information

The easy maze is 33x17, the normal maze is 65x33, and the hard maze is 129x65. The starting position is always at the top left and the goal is always at the bottom right. There are no loops in any maze.