-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
75 additions
and
5 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,5 +1,35 @@ | ||
# Exam 13 - Maze Escape | ||
# Final Exam - Maze Escape | ||
|
||
The final exam is organized as a competition. Each team has 3 attempts to escape the maze with their robot, using the robot's full sensor capabilities. The score for the exam is based on the best of the three attempts. | ||
- The robot starts inside the maze, randomly placed within a 2x2 cell area. | ||
- There is always only one escape path from the maze. | ||
- The maze contains no loops. | ||
|
||
In total for final exam the team can earn up to 50 points | ||
- Maze escape up to 40 points | ||
- Git and project documentation quality up to 10 points | ||
|
||
## Attempt Rules | ||
|
||
- Teams have at least 45 minutes between attempts to modify their program. | ||
- The code used during the competition must be uploaded to Git by 11:59 PM on the same day. | ||
- The competition code must not contain specific information about the maze (e.g., paths, minotaur locations). Pre-known information, such as cell size, may be included. | ||
|
||
- There are 3 randomly placed minotaurs and 1 treasure. | ||
- Each encounter with a minotaur results in a 30-second penalty. | ||
- Finding the treasure reduces the final time by 1 minute. | ||
|
||
- The maze consists of 8x8 cells, with each cell measuring 40x40 cm. Black lines on the floor mark the boundaries between cells. | ||
- ArUco tags will be placed on the maze ground, providing hints about the escape route, the presence of minotaurs, or the path to the treasure. | ||
- The formula for calculating the score is: `y=min(max(kx+q),0,40)` | ||
|
||
## Maze Visualization | ||
|
||
![Maze](../images/maze.png) | ||
Example of possible maze. | ||
- Walls - red lines | ||
- Escape path - green line | ||
- Start - green cell | ||
- Treasure (bonus) - blue cell | ||
- Minotaur (penalty) - red cell | ||
|
||
![Maze](../images/maze.png) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters