MultiAgentPacman offers a Python-based game environment where users can implement, visualize, and benchmark multiple AI agents in the Pacman domain. It supports adversarial search algorithms like minimax, expectimax, alpha-beta pruning, as well as custom reinforcement learning or heuristic-based agents. The framework includes a simple GUI, command-line controls, and utilities to log game statistics and compare agent performance under competitive or cooperative scenarios.

BomberManAI is an AI agent designed to play the classic Bomberman game autonomously. Developed in Python, it interfaces with a game environment to perceive map states, available moves, and opponent positions in real time. The core algorithm combines A* pathfinding, breadth-first search for reachability analysis, and a heuristic evaluation function to determine optimal bomb placement and evasion strategies. The agent handles dynamic obstacles, power-ups, and multiple opponents on various map layouts. Its modular architecture enables developers to experiment with custom heuristics, reinforcement learning modules, or alternative decision-making strategies. Ideal for game AI researchers, students, and competitive bot developers, BomberManAI provides a flexible framework for testing and improving autonomous gaming agents.

ePH-MAPF provides an efficient pipeline for computing collision-free paths for dozens to hundreds of agents on grid-based maps. It uses prioritized heuristics, incremental search techniques, and customizable cost metrics (Manhattan, Euclidean) to balance speed and solution quality. Users can select between different heuristic functions, integrate the library into Python-based robotics systems, and benchmark performance on standard MAPF scenarios. The codebase is modular and well-documented, enabling researchers and developers to extend it for dynamic obstacles or specialized environments.