Watch a robot learn to navigate a maze through trial, error, rewards, and penalties — just like real AI agents learn!
The maze is the world the robot lives in — walls, open paths, a goal, and traps!
The robot tries moves. Reaching the goal = +10 points. Hitting walls or traps = penalty.
Robot builds a "Q-Table" — a cheat sheet of which action is best from every position.
Over hundreds of episodes, the robot improves — fewer steps, more rewards each run!
You trained a Q-Learning robot to navigate a maze. Enter your name to get your certificate!
The learner that takes actions in the environment to maximise reward over time.
The world the agent lives in. It responds to actions with new states and rewards.
A table that stores the expected reward for every (state, action) pair. Updated after every step.
Epsilon (ε) controls this. High ε = explore randomly. Low ε = use learned knowledge.
Q(s,a) ← Q(s,a) + α[r + γ·max Q(s',a') − Q(s,a)]. The heart of Q-learning!
After training, the optimal policy selects the best action from every state — the arrows you saw!