ألفا جو وألفا زيرو

Go is difficult for brute-force search because of its large search space and the challenge of evaluating positions. AlphaGo combines a policy network, which suggests promising moves, and a value network, which evaluates board positions, with Monte Carlo Tree Search. Its original Nature paper describes supervised learning from human expert games followed by reinforcement learning from self-play. AlphaZero generalizes self-play reinforcement learning to Go, chess, and shogi; it starts from random play and uses the game rules without human game examples. The AlphaZero paper reports superhuman play in the tested games, including reaching that level in chess and shogi within 24 hours of training. MuZero is different: it learns a latent model of rewards and state transitions sufficient for planning, without being supplied the game’s rules or full dynamics. These are research results in games, not evidence that the same performance transfers to arbitrary planning tasks.