Parallel computing・Machine Learning・Game Development
Personal Site · LinkedIn · ANU · Kyoto University
I'm interested in high-performance search algorithms, parallel tree search, self-play reinforcement learning, and making strong AIs for imperfect information two-player games — especially falling-block games.
I'm also the developer of the live-service competitive block stacker, God of Stackers. Interested in the game? Join our Discord server!
Currently most active on:
- Parallel search algorithms with advanced load-balancing
- Statistical, Monte Carlo and ML approaches to problems in game theory
- Project managing and developing God of Stackers
Parallel MCTS engine for versus Tetris / tetromino battlers
- Parallel Monte-Carlo Tree Search with Transposition Driven Scheduling (TDS) load balancing
- Bitboard game state + fast move generation
- Custom message-passing architecture for scalability
- Online any-time planning
Live service, competitive multiplayer stacker with regular updates
- Real time, online multiplayer using WebSockets
- Scaling backend using multiple cores + Redis pub/sub
- High perfomance client with lower input latency than both TETR.IO and jstris
- Daily active users and >1,000 registered players
- Major updates every month + minor patch every week
Open source interoperability between popular machine learning frameworks
- Major contributor and early engineer (2022-2024)
- Enabled model and training pipeline conversion from Torch to JAX and Tensorflow
- Performance improvements across CNN, RNN and Transformer architectures
- Computation graph approach ensured robust and correct transpilations