Course unit
Last updated: 09/12/2024
EditThis modules focuses on automatic decision methods for deciding which actions to carry out when it is necessary to think of several moves in advance, since a single action is not enough to achieve the objective, as in a game of chess. The module is divided into 3 sections :
-Solving Problems by Searching (DFS, BFS, A*, Optimization)
-Adversarial Search (minimax, alpha-beta)
-Constraint Satisfaction Problems (CSP, COP, backtrack , propagation, arc-consistency)
On completion of the unit, the student will be capable of: | Classification level | Priority |
---|
Percentage ratio of individual assessment | Percentage ratio of group assessment | ||||
---|---|---|---|---|---|
Written exam: | % | Project submission: | % | ||
Individual oral exam: | % | Group presentation: | % | ||
Individual presentation: | % | Group practical exercise: | % | ||
Individual practical exercise: | % | Group report: | % | ||
Individual report: | % | ||||
Other(s): % |
Type of teaching activity | Content, sequencing and organisation |
---|---|
Supervised work | (12h) |
Labs | (4h30) |