From the preprint [1]: > In Go, MuZero slightly exceeded the performance of AlphaZero, despite using less computation per node in the search tree (16 residual

From the preprint [1]: > In Go, MuZero slightly exceeded the performance of AlphaZero, despite using less computation per node in the search tree (16 residual blocks per evaluation in MuZero compared to 20 blocks in AlphaZero). This suggests that MuZero may be caching its computation in the search tree and using each additional application of the dynamics model to gain a deeper understanding of the position. It also strikes me as possible that just not giving the system the rules to start with might have allowed it to explore more efficient strategies. [1] https://arxiv.org/pdf/1911.08265.pdf https://arxiv.org/pdf/1911.08265.pdf