AI I
Tutorial for Artificial Intelligence I
Organization
To obtain the credit, it is necessary to collect 60 points for the assignments (see below). During the tutorial, we will always get acquainted with the assignments, but we will also look at the techniques discussed in the course and other practical uses for that techniques.
If someone feels that they are missing the opportunity to earn the credit, do not be afraid to contact me. Such cases will be dealt with individually based on your approach to the exercise.
Assignments
There will be 5 implementation assignments, for which a total of 100 points can be obtained. Solutions to the assignments are submitted via ReCodEx. Details and codes used for the assignments are published in a public repository. The deadlines for each assignment are posted in ReCodEx. Note that there are 2 deadlines for each assignment. Any attempts before the first deadline will be awarded full points. Any attempts after the first deadline will be with 50% penalty.
Don’t underestimate the first assignments that are worth less points, the later assignments are much more challenging and it is more difficult to earn the full number of points.
| Assignment | Max. points | Deadline | Recommended solving technique |
|---|---|---|---|
| Dino | 10 | see ReCodEx | rule-based agent |
| Ms. Pac-Man | 20 | see ReCodEx | uniform-cost search |
| Sokoban | 20 | see ReCodEx | A* with custom heuristic |
| Cell Wars | 25 | see ReCodEx | minimax or Monte Carlo tree search |
| Minesweeper | 25 | see ReCodEx | backtracking search for CSPs |