Built a Q-learning agent capable of completing the mountain car game.
To successfully complete this challenge, an agent must navigate the car across the hill. However, the car lacks the necessary power to ascend the hill in a single attempt. We aim to complete the task in under 1000 steps. My Q-learning agent utilises an epsilon-greedy exploration strategy to solve game. It discovers that the sole method to accomplish the task involves repeatedly traversing back and forth, gathering enough momentum to climb the hill.
I experimented with a double Q-learning agent to improve the agent however, the gains were minimal. With more time for hyperparameter tuning and testing different explorations of strategies, this agent would have outperformed the standard agent.
