90 likes | 199 Vues
This paper explores a framework for analyzing paths in motion-based games through game-theoretic principles. The focus is on the Bomberman game, where agents move and drop bombs to eliminate opponents. Various strategies are proposed, including Horizon-Regret-Minimization, Max-Min, and two greedy approaches. The study examines both 1-on-1 and free-for-all matchups, emphasizing strategy effectiveness across different goal scenarios and bomb placement patterns. Experiment results reveal insights into optimal path selection and agent survival tactics in dynamic environments.
E N D
Game-Theoretic Selection of Paths in Motion-based Games Joseph Jaeger Dr. Kostas Bekris Andrew Kimmel 18 July 2013
Game Theory Game Theory Max-Min(Shoham & Leyton-Brown 2009) Regret Minimization (Halpern & Pass 2012) Motion-based Games Motion Planning
Benchmark Game: Bomberman Actions: Move around and drop bombs to destroy the environment/other agents Goal: Be the last agent not destroyed by a bomb
Variation Random Goals Periodic Bomb Placement Continuous Environments
Strategies & Experiments Stategies Horizon-Regret-Min (HorizonRM) Max-Min (MM) Greedy Greedy-Avoidance (GA) Experiments 1-on-1 Free-for-All