OVERVIEW
The 2025 Maze Solving Competition Using Interactive Agents will be open to receive participants who will try to outperform their competition in solving mazes while accounting for positive and negative interactions among other agents, i.e., other participants. The competition will assess the maze-solving tactics and the interaction strategies adopted by participants. The interactions among agents will be based on the Prisoner’s Dilemma, where each agent should consider its actions without knowing the actions of the other agent. Multi-layer mazes will be used and the total time of solving will be tracked to assess the winners. However, the interactions with other agents will have an impact on the final timer, by adding or removing precious seconds to the agent/participant time.
The competition was built in PEAK framework:
- documentation: https://www.gecad.isep.ipp.pt/peak
- github: https://github.com/gecad-group/peak-mas
HOW TO PARTICIPATE
- 1.Create an agent: Use the template available to create your agent.
- 2.Test and validate: Use our API to create simulations to test and validate your agent.
- 3.Submit to the competition
- 4.Wait to be announced as the winner!
IMPORTANT DATES
- • March 2025: competition announcement;
- • Mid-March 2025: opening for simulations;
- • April 2025: opening of applications;
- • Beginning of May 2025: closing of applications;
- • May 2025 (AAMAS'25): results and winners announcement.
AGENT TEMPLATE
Agent template: to be announced shortly
Requirements: to be announced shortly
API DESCRIPTION
The API provides two endpoints at the URI: to be announced shortly
POST /sim
Creates and starts a simulation for validation. It returns a JSON with the simulation ID (e.g., {sim: "hj23jkemn3"}).
GET /sim/{id}
Returns the results, in an HTML page, of the simulation with ID equal to {id}.
RULES
Objective
Participants must navigate their agents through a multi-layered maze, interacting with other agents using strategies based on the Prisoner's Dilemma, to reach the center in the shortest time possible.
Competition Setup
- Maze Structure: Multi-layered maze with passages connecting the layers.
- Starting Point: All agents start from the bottom layer, which has several entrances. Participants choose an entrance before the start.
- Positioning: The maze uses a grid system with coordinates (i.e., x, y, layer).
Movement Behavior
- Visibility: Agents can see in 360º up to 3 spaces in distance.
- Behavior input: Positioning matrix (i.e., 6x6).
- Behavior output: Left, right, up, down, or stay.
- Time to reply: Less than 10 seconds.
Interaction Behavior
- Visibility: Agents can see and identify each other when they are near the same space.
- Interaction Mechanism: Based on the Prisoner's Dilemma.
- Both Greet ('Hi'): 2 seconds removed from both agents' final time.
- One Greets, One Doesn't: Greeter adds 3 seconds to their final time, non-greeter removes 3 seconds.
- Both Do Not Greet: 2 seconds added to both agents' final time.
- Behavior input: Dictionary of visible agents and a positioning matrix (i.e., 6x6).
- Behavior output: True (i.e., to greet), or false (i.e., not to greet).
- Time to reply: Less than 5 seconds.
Scoring
- Final Score: Total time to complete the maze, including time adjustments from interactions.
- Mazes: The competition takes place in 3 different mazes.
- Evaluation: Based on time to complete all mazes and number of victories.
Download the competition guidelines.
POSSIBLE IMPLEMENTATIONS
Participants are invited to create intelligent agents using Python packages and external APIs for:
- Reinforcement learning to learn from interactions with other agents.
- Large language models for decision support.
- Computer vision for movement.
- ...
CONTACTS
Please feel free to contact us with any questions or concerns.
• Luis Gomes, GECAD, LASI, Polytechnic of Porto, lfg@isep.ipp.pt
• Bruno Ribeiro, GECAD, LASI, Polytechnic of Porto, brgri@isep.ipp.pt
• Zita Vale, GECAD, LASI, Polytechnic of Porto, zav@isep.ipp.pt