Maze solver using Naive Reinforcement Learning for beginners

Q-Learning is centered around the Bellman Equation and finding the q-value for each action at the current state. Finding an optimal policy involves recursively solving this equation multiple times. Only the main parts of the Bellman Equation relevant to this implementation will be explained in this article. Who wants to be in a 2D world anyway? Well… lets put a smile on that face, shall we?