http://webdocs.cs.ualberta.ca/~sutton/book/ebook/pseudotmp1.png
I can't find or realize if scilab got “jump” instructions which allow
me coding this algorithm.
This algorithm does not require a goto statement.
Initialization:
done = false
while not done
policy eval
done = true
for each s ...
if b not= pi(s) done = false
end
--
Steven Bellenot http://www.math.fsu.edu/~bellenot
Professor and Associate Chair phone: (850) 644-7405
Department of Mathematics office: 223 Love
Florida State University email: bellenot at math.fsu.edu
Hello,
If b not=pi(s) policy false
this instrution is inside at for cycle but there is other if.
If policy (1) stop else goto 2(policy improvement)
I've already coded part 2 of algorithm. Has 3 for cyles under a while.
Using other while is a waste of resources. But seems the only solution.