Train on Small, Play the Large: Scaling Up Board Games with AlphaZero and GNN
Not on the map. Why?
Abstract (arXiv)
Playing board games is considered a major challenge for both humans and AI researchers. Because some complicated board games are quite hard to learn, humans usually begin with playing on smaller boards and incrementally advance to master larger board strategies. Most neural network frameworks that are currently tasked with playing board games neither perform such incremental learning nor possess capabilities to automatically scale up. In this work, we look at the board as a graph and combine a graph neural network architecture inside the AlphaZero framework, along with some other innovative improvements. Our ScalableAlphaZero is capable of learning to play incrementally on small boards, and advancing to play on large ones. Our model can be trained quickly to play different challenging board games on multiple board sizes, without using any domain knowledge. We demonstrate the effectiveness of ScalableAlphaZero and show, for example, that by training it for only three days on small Othello boards, it can defeat the AlphaZero model on a large board, which was trained to play the large board for 30 days.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 17 of its 47 references that are in the map. First posted on arXiv 18 Jul 2021.
Builds on
17 of 47 references.
References · 17
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2018Link Prediction Based on Graph Neural Networkscited by 832
- 2015Gated Graph Sequence Neural Networkscited by 796
- 2017Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithmcited by 734
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 561
- 2018MolGAN: An implicit generative model for small molecular graphscited by 393
- 2018Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generationcited by 364
5 more
- 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
- 2018Learning Deep Generative Models of Graphscited by 229
- 2020Graph Clustering with Graph Neural Networkscited by 163
- 2016Discriminative Embeddings of Latent Variable Models for Structured Datacited by 131
- 2018Learning Heuristics for Quantified Boolean Formulas through Deep Reinforcement Learningcited by 15
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 2.
6 papers.
- 2022Scaling Laws Under the Microscope: Predicting Transformer Performance from Small Scale Experimentscited by 23
- 2022Online 3D Bin Packing Reinforcement Learning Solution with Buffercited by 8
- 2022Brick Tic-Tac-Toe: Exploring the Generalizability of AlphaZero to Novel Test Environmentscited by 2
- 2023From Images to Connections: Can DQN with GNNs learn the Strategic Game of Hex?cited by 1
- 2024Towards Faster Matrix Diagonalization with Graph Isomorphism Networks and the AlphaZero Frameworkcited by 0
- 2024Enhancing Chess Reinforcement Learning with Graph Representationcited by 0
- 2024Enhancing Chess Reinforcement Learning with Graph Representation31 Oct 2024
- 2024Towards Faster Matrix Diagonalization with Graph Isomorphism Networks and the AlphaZero Framework30 Jun 2024
- 2023From Images to Connections: Can DQN with GNNs learn the Strategic Game of Hex?22 Nov 2023
- 2022Online 3D Bin Packing Reinforcement Learning Solution with Buffer15 Aug 2022
- 2022Brick Tic-Tac-Toe: Exploring the Generalizability of AlphaZero to Novel Test Environments13 Jul 2022
- 2022Scaling Laws Under the Microscope: Predicting Transformer Performance from Small Scale Experiments13 Feb 2022