There is a mouse in a maze which wants to get out of the maze with less number of steps.
In the first stage, the mouse will have no memory and no strategy.
In the second stage, it will have memory and a basic strategy.
In the final stage, the mouse will have memory and a strategy based on probability.
The python code based on the TKinter GUI is available in https://github.com/benfitsV1/mouse-in...
The code is written and read by: / habeebperwad