Mixture of Masters: Sparse Chess Language Models with Player Routing
Modern chess language models are dense transformers trained on millions of games played by thousands of high-rated individuals. However, these monolithic networks tend to collapse into mode-averaged behavior, where stylistic boundaries are blurred, and rare but effective strategies are suppressed. To counteract homogenization, we introduce Mixture-of-Masters (MoM), the first chess mixture-of-experts model with small-sized GPT experts emulating world-class grandmasters. For each move, a post-hoc learnable gating network selects the most appropriate persona to channel depending on the game state, allowing MoM to switch its style dynamically, e.g., Tal's offensive vocation or Petrosian's defensive solidity. When evaluated against Stockfish on unseen standard games, MoM outperforms both dense individual expert networks and popular GPT baselines trained on aggregated data, while ensuring generation variety, control, and interpretability.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Know your Enemy: Investigating Monte-Carlo Tree Search with Opponent Models in Pommerman
In combination with Reinforcement Learning, Monte-Carlo Tree Search has shown to outperform human grandmasters in games such as Chess, Shogi and Go with little to no prior domain knowledge. However, most classical use ca…
reinforcement-learningReinforcement LearningHuman and Machine Intelligence in n-Person Games with Partial Knowledge: Theory and Computation
In this paper, I formalize intelligence measurement in games by introducing mechanisms that assign a real number -- interpreted as an intelligence score -- to each player in a game. This score quantifies the ex-post stra…
Decision MakingGame of ChessAI sustains higher strategic tension than humans in chess
Strategic decision-making requires balancing immediate opportunities against long-term objectives: a tension fundamental to competitive environments. We investigate this trade-off in chess by analyzing the dynamics of hu…
Simulating Human Grandmasters: Evolution and Coevolution of Evaluation Functions
This paper demonstrates the use of genetic algorithms for evolving a grandmaster-level evaluation function for a chess program. This is achieved by combining supervised and unsupervised learning. In the supervised learni…
Giraffe: Using Deep Reinforcement Learning to Play Chess
This report presents Giraffe, a chess engine that uses self-play to discover all its domain-specific knowledge, with minimal hand-crafted knowledge given by the programmer. Unlike previous attempts using machine learning…
BIG-bench Machine LearningDeep Reinforcement LearningGame of Chessreinforcement-learning+2