Artificial Intelligence is an area within computer science that deals with the solution of complicated problems that normally require human intelligence. The purpose of the course is to let the students work with such problems.

Strategy games are games where there are known rules for the course of the game, as well as a strategy for how these rules are best applied to win. Examples are tic-tac-toe, checkers, mill and chess, which are so-called 'perfect information games' and games with built-in chance, for example back-gammon.

Strategy games serve as models for various computer science problem solving methods that find application in a number of areas: Route finding, VLSI design, Robot navigation, assembling robots, automatic planning, etc.

Problem solving by state space. We will analyze and implement algorithms for finding a way through a labyrinth, finding the shortest route between cities, scheduling, planning tasks, etc.

Design and implementation of a strategy game. We will learn how a computer can play chess, and implement our own computer chess program, or another strategy game

Explain related methods within Artificial Intelligence: Game theory, Heuristic search, Logic programming.

Design and implement solutions that make use of algorithms and data structures within heuristic search and game theory.

Analyze and discuss the correctness, performance and complexity of algorithms used in the course.
Assess the applicability of these methods and algorithms to a given problem.
Document work with a specific problem in speach and writing.