Skip to content

Latest commit

 

History

History
4 lines (3 loc) · 220 Bytes

README.md

File metadata and controls

4 lines (3 loc) · 220 Bytes

Q-learning-maze-solver

A Q Learning algorithm where the agent learns to go from 1x1 square to the goal without touching the red obstacle squares in a nxn grid. It perfects its learning on around 140-150 generations.