送交者: 短江学者 于 2016-03-15, 10:00:16:

回答: AlphaGo's memory can be messed up when against a random number generator 由 conner 于 2016-03-15, 09:21:14:

• The searching tree continues to grow and go deep. if trimmed, will lose power (无内容) - conner (0 bytes) 2016-03-15, 10:40:25 (803962)
  • by deep I mean deep with a high belief bayesian probability (无内容) - conner (0 bytes) 2016-03-15, 10:58:59 (803967)
  • yes but after a while it shrinks -an extreme is just like 中盘投子。 (无内容) - 短江学者 (0 bytes) 2016-03-15, 10:42:36 (803964)
    • yes, when the tree is complete in the depth, the result is decided - conner (50 bytes) 2016-03-15, 10:45:52 (803966)
• Q-learning is approximate dynamic programming with expectation - 短江学者 (169 bytes) 2016-03-15, 10:05:01 (803958)

加跟贴