Next: About this document ...
Up: TD( ) algorithm
Previous: Algorithm
Equality of schemes using backward and forward
updates
Now we will show that "looking forward" and "looking
backward" schemes are equal (i.e. will give same results).
Let
us say:
for the forward scheme
for the
backward scheme
We will show that
where,
if
,and
if
We can rewrite
as
We have for the left side of the equation:
=
And for the right side:
...
So, we have :
We have for right side the same expression we have already for the
left side of the equation. This implies that both methods give
same updates at the end of the run.
Yishay Mansour
2000-01-06