I am trying to implement a tabular-based GLIE Monte-Carlo learning algorithm. So I repeat n times:
- create observations using my previous policy $\pi_{n-1}(s)$
- update my state-action values using the observations generated in 1 with the monte-carlo update rule: $Q_n(s_t,a_t)= Q_n(s_t,a_t)+1/N(s_t,a_t)\times(G_t-Q_n(S_t,a_t))$
- update my policy to $\pi_{n}$ using epsilon-geedy improvement with $\epsilon=1/(n+1)$.
In step 2 I need to decide for an initial estimate $\tilde{Q}_n$. Is it a decent option to use $\tilde{Q}_n=Q_{n-1}$?