Reinforcement Learning, Monte Carlo Method, Machine Learning, Artificial Intelligence.
this, ϵ-greedy policies are used. In ϵ-greedy policies, most of the time the action with the highest Q-value is chosen. But with a probability ϵ, they can select an action at random. This means that every time the agent has to choose an action, there is a probability ϵ that a random action will be