This program gives the user a choice between two reinforment learning algorithms: Epsilon-Greedy and Lower Confidence Bound - this algorithm is then used to find the shortest path within a lattice.