Stanford computer science professor just revealed how to master...

83-minutes. free. By Stanford.
here's what they cover:
• search problems vs. stochastic environments
• policy evaluation & q-value recurrence math
• value iteration loop engineering
• convergence limits under a cyclic graphs
Bookmark & watch today. Then read the article below.
