SQUARE MAZE SOLVED USING Q-LEARNING & EPSILON-GREEDY POLICY

Solving a randomly generated square maze using a Q-Learning algorithm involving an epsilon-greedy policy.

The aim of this code is solving a randomly generated square maze (dimension n) using a Q-Learning algorithm involving an epsilon-greedy policy.
A report has been done so as to help the user to better understand the code and the theory behind Q-Learning.
The user can choose the starting and ending points of the maze and its dimension n.