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.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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.
Cite As
Jonathan Sanz Carcelén (2026). SQUARE MAZE SOLVED USING Q-LEARNING & EPSILON-GREEDY POLICY (https://www.mathworks.com/matlabcentral/fileexchange/80146-square-maze-solved-using-q-learning-epsilon-greedy-policy), MATLAB Central File Exchange. Retrieved .
General Information
- Version 2.0.0 (1020 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
