n-step TD bridges one-step TD and Monte Carlo learning by using outcomes across multiple future steps. TD(λ) combines n-step returns: λ tunes the balance between bias and variance, with λ=1 approaching Monte Carlo. Computing these returns requires future rewards and states, while eligibility traces provide an online backward-view implementation of TD(λ). section 6.5
Figure 6.7 Comparison of TD(0), Monte Carlo and TD(λ) methods.
Compare the roles of TD(0), Monte Carlo, and TD(λ). section 6.5
