Intelligent Bomberman with reinforcement learning
Abstract
Bomberman is a strategical, maze-based game where the players defeat their enemies by placing a multi-direction count-down bomb that would explode and destroy obstacles and other players. In this paper, a simplified version of Bomberman is implemented in Java, where different controlled agents are placed. Each agent represents one of five reinforcement learning methods: Q-Learning, Sarsa, Double Q-Learning, and Deep Q Neural Network with two state representations: 5-tiles information and complete information. Then, we investigate whether a specific reinforcement learning method can successfully learn to play Bomberman efficiently by evaluating them with ad-hoc agents and finally against each other. The configuration of 5-tiles information with Sarsa archives the best overall quantitative results.
Keywords
Not available
Specialisations
Similar theses
- Curiosity-based Reinforcement Learning GIANLUCA MANNONI · University of Pisa · 2026
- Achieving Robust Autonomous Driving through Multi-modality Deep Reinforcement Learning Kritsanaphong Kittithammo · 2026
- Deep Reinforcement Learning for Intrusion Detection and Response in Software-Defined Networks Trung Phan Van · Chemnitz University of Technology · 2026
- Contributions to reinforcement learning with function approximators Riad Akrour · 2025
- Explorations of In-Context Reinforcement Learning Ethan Brooks · University of Michigan · 2024
- Machine Learning for Cooperative Logistics: Multi-Agent Reinforcement Learning to Negotiate Fair Outcomes Stephen Mak · University of Cambridge · 2024
