Bitboard version of Tetris AI
Xingguo Chen, Pingshou Xiong, Zhenyu Luo, Mengfei Hu, Xinwen Li, Yongzhou L\"u, Guang Yang, Chao Li, Shangdong Yang

TL;DR
This paper introduces a high-performance Tetris AI framework utilizing bitboard optimization and advanced RL algorithms, significantly improving simulation speed and training efficiency for reinforcement learning research.
Contribution
It presents a novel bitboard-based Tetris implementation, an afterstate-evaluating actor network, and a buffer-optimized PPO algorithm, enhancing scalability and efficiency in RL training.
Findings
Achieved a 53-fold speedup over OpenAI Gym-Tetris.
Outperformed traditional networks with fewer parameters.
Reached an average score of 3,829 on 10x10 grids within 3 minutes.
Abstract
The efficiency of game engines and policy optimization algorithms is crucial for training reinforcement learning (RL) agents in complex sequential decision-making tasks, such as Tetris. Existing Tetris implementations suffer from low simulation speeds, suboptimal state evaluation, and inefficient training paradigms, limiting their utility for large-scale RL research. To address these limitations, this paper proposes a high-performance Tetris AI framework based on bitboard optimization and improved RL algorithms. First, we redesign the Tetris game board and tetrominoes using bitboard representations, leveraging bitwise operations to accelerate core processes (e.g., collision detection, line clearing, and Dellacherie-Thiery Features extraction) and achieve a 53-fold speedup compared to OpenAI Gym-Tetris. Second, we introduce an afterstate-evaluating actor network that simplifies state…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
