• Your selection is empty.

    Register the diplomas, courses or lessons of your choice.

Search Algorithms

  • School / Prep

    ENSEIRB-MATMECA

Internal code

EI9IS314

Description

This module takes a closer look at the links between Artificial Intelligence and the algorithmic complexity of decision and solution search problems. It introduces the concepts of heuristics for games and state graph search, as well as optimization approaches using meta-heuristics. SAT, constraint programming and answer set programming are used to discover declarative and modeling-based approaches.The courses are put into practice with the help of practical exercises in Python.Course outline :Advanced game algorithms (3h / 6h)Heuristics, Alpha-Beta, Iterative DeepeningAlgos on null windowsMonte Carlo Tree SearchPrinciples of Deep Reinforcement Learning for game treesSearching state graphs (2h / 3h)Heuristics, A*Local searchMeta-heuristic search (1h / 3h)Ant colony optimizationGenetic algorithmsSAT and Constraint Programming (3h / 3h)Answer Sets Programming (4h / 6h)Reference book : Artificial Intelligence, a modern approach (Stuart and Russell)

Read more

Teaching hours

  • CIIntegrated courses33h

Syllabus

This module takes a closer look at the links between Artificial Intelligence and the algorithmic complexity of decision and solution search problems. It introduces the concepts of heuristics for games and state graph search, as well as optimization approaches using meta-heuristics. SAT, constraint programming and answer set programming are used to discover declarative and modeling-based approaches.The courses are put into practice with the help of practical exercises in Python.Course outline :Advanced game algorithms (3h / 6h)Heuristics, Alpha-Beta, Iterative DeepeningAlgos on null windowsMonte Carlo Tree SearchPrinciples of Deep Reinforcement Learning for game treesSearching state graphs (2h / 3h)Heuristics, A*Local searchMeta-heuristic search (1h / 3h)Ant colony optimizationGenetic algorithmsSAT and Constraint Programming (3h / 3h)Answer Sets Programming (4h / 6h)Reference book : Artificial Intelligence, a modern approach (Stuart and Russell)

Read more

Further information

This module takes a closer look at the links between Artificial Intelligence and the algorithmic complexity of decision and solution search problems. It introduces the concepts of heuristics for games and state graph search, as well as optimization approaches using meta-heuristics. SAT, constraint programming and answer set programming are used to discover declarative and modeling-based approaches.

Read more

Assessment of knowledge

Initial assessment / Main session - Tests

Type of assessmentType of testDuration (in minutes)Number of testsTest coefficientEliminatory mark in the testRemarks
Integral Continuous ControlContinuous control1

Second chance / Catch-up session - Tests

Type of assessmentType of testDuration (in minutes)Number of testsTest coefficientEliminatory mark in the testRemarks
ProjectReport0.4