See a program learn the best actions in a grid-world to get to the target cell, and even run through the grid in real-time! This is a Q-Learning implementation for 2-D grid world using both epsilon-greedy and Boltzmann exploration policies.
