Lab 9

[valid 2025-2026]

Concurrency
Consider a valid maze designed in the previous lab. Inside the maze, at a random location, there is a bunny 🐰 trying to find the exit. A number of bad robots 🤖 🤖 🤖 must catch the bunny by exploring the maze using various strategies. The robots are initially placed at distinct random positions. Two robots cannot occupy the same cell at the same time. The robots can access a shared memory where they can store information about the maze and the bunny (if a robot is very close to the bunny, it might see it and share this information). The game ends when the bunny finds the exit or a robot catches it.

The main specifications of the application are:


Compulsory (1p)


Homework (2p)


Advanced (2p+)

References

Objectives