Environment for learning Search Algorithms

The main  purpose of a this game is forming the basis for a search algorithm learning environment. The game is a modified version of the classic Bomberman/Dyna Blaster game developed by Hudson Soft in 1983. In this game, players strategically place bombs to eliminate obstacles and defeat enemies, aiming to reach the exit and progress through levels. Various power-ups, such as extra lives and increased bomb capabilities, can be collected. Players must avoid enemy contact and bomb explosions, including their own, making it important to be cautious when placing bombs.

The game consists of 16 levels, featuring different elements such as ground, mud, indestructible blocks, and breakable bricks. Players and enemies move at regular speed on the ground but are slowed when traversing mud. Blocks are indestructible, while bricks can be destroyed by bomb explosions. Ghosts and flying enemies can move through the bricks.

The game's enemies are designed to challenge players and demonstrate the operation of various search algorithms interactively. Each enemy is controlled by a finite state machine and employs one of the following real-time search algorithms: Breadth-First Search (BFS), Depth-First Search (DFS), Dijkstra's algorithm, or A*. By combining different state machines and search algorithms, a wide range of enemy complexities is achieved, from basic back-and-forth movement to those capable of recognizing danger and seeking safe locations.