model-based-planning-muzero technique sourced
Self-play planning with learned models (AlphaZero, MuZero, Dreamer)
Agents that combine tree search or imagined rollouts with neural policy and value networks trained by self-play, where MuZero and Dreamer also learn the environment's dynamics, reach superhuman play from rules or pixels alone.
mechanism
AlphaZero pairs MCTS with a network that outputs a move prior p and a value v for a state; games generated by the search train p toward search visit counts and v toward outcomes, so search and network improve each other given only the rules. MuZero drops the need for rules at planning time: a representation network encodes observations into a latent state, a dynamics network predicts the next latent state and reward for an action, and a prediction network outputs policy and value, so MCTS runs entirely in the learned latent space. EfficientZero adds self-supervised consistency and value-prefix losses for sample efficiency. Dreamer learns a recurrent world model and trains an actor-critic on imagined trajectories; DreamerV3 adds symlog and return normalization so one hyperparameter set works across domains, and Dreamer 4 trains its world model mostly on unlabeled video and learns the policy offline inside it. For design work the same loop can be retrained on each rule variant and the converged play compared.
limitations
- Training is expensive: MuZero's board-game runs used 16 TPUs for training and 1,000 for self-play, and each significant rule change needs retraining or fine-tuning.
- Self-play converges to strong play, not human play, so balance conclusions can reflect exploits humans would never find or use.
- Learned dynamics drift over long rollouts; MuZero did poorly on 6 Atari games and DreamerV3 needed about 30M steps (17 days of play) for its first Minecraft diamond.
- Most simulation games are many-player, simultaneous-move, partly hidden, and long-horizon, which the two-player perfect-information AlphaZero setup does not cover directly.
- Policies are opaque, so designers cannot read why an AI rival chose a strategy, and giving it a personality requires reward shaping rather than editing rules.
relations
6 stored edgesCreature learning
Sample-efficient model-based learners (EfficientZero needed about two hours of experience) make it plausible for a creature to learn new behaviors from player reward within a session, by planning in a learned model of its world rather than reacting with a fixed network.
Military operations
Opponents plan with a learned value function plus search over unit actions, giving strong play in operational simulations where hand-written doctrine is brittle; latent models allow planning where exact rollouts are too slow.
Policy toggles
Each toggle combination is a rule variant; converged self-play under each variant measures how much a policy shifts outcomes and flags toggles that are strictly dominant or never worth enacting.
Rival firms
Competitor AI becomes a policy trained by self-play against the game's own rules, so it re-adapts when economic rules change in a patch instead of needing rewritten heuristics; training compute per rule set is the cost.
Tech tree
Self-play agents trained on each candidate tree reveal dominant research orders and unused branches, the same comparison AlphaZero made across chess rule variants.
backlinks
computed from other recordsclaims
8 with sourcesAlphaZero reached superhuman chess, shogi, and Go within 24 hours from random play given only the rules, beating a world-champion program in each game.
MuZero matched AlphaZero in Go, chess, and shogi and surpassed R2D2 on Atari while learning its own model instead of being given the rules (Nature, December 2020).
MuZero's board-game training used 16 TPUs for training and 1,000 for self-play at 800 simulations per move, and it performed poorly on 6 Atari games.
EfficientZero reached 194.3% mean and 109.0% median human-normalized score on Atari 100k from about two hours of real-time game experience.
AlphaZero trained from scratch on nine chess rule variants was used to compare decisiveness, piece values, and dynamism across variants as an in silico game balance assessment.
DreamerV3 (Nature, April 2025) beat specialized methods on over 150 tasks with one configuration and was the first algorithm to collect Minecraft diamonds from scratch without human data, first at about 30M environment steps (about 17 days of play).
Dreamer 4 (September 2025) learned a Minecraft world model that runs interactively on one GPU and obtained diamonds from offline data only, choosing sequences of over 20,000 keyboard and mouse actions from pixels.
MuZero-RC chose per-frame VP9 quantisation on part of YouTube live traffic for an average 4% bitrate reduction, its first production deployment, outside games.