Overordnede kursusmål
Strategic games are games with well defined rules for the course of
the game, and a strategy for applying these rules with the purpose
of winning. Examples are tic-tac-toe, checkers and chess witch are
so called perfect-information games, and games with chance ex.
back-gammon. Strategic games serves as models for problem solving
methods in computer science. Methods that are applied in
engineering-tasks such as VLSI design, robot-navigation,
jobshop-planning etc.
Læringsmål
En studerende, der fuldt ud har opfyldt kursets mål, vil kunne:
- - can use and explain relevant fields of Artificial
Intelligence: Game-theory, Heuristic search.
- - can evaluate the usability of these methods in a given
problem.
- - has practical experience from design and implementation of
complex recursive algorithms.
- - has practical experience in analysis of performance and
complexity.
- - has practical experience in tuning of algorithms.
- - can document his work in writing.
- - can discuss his work in a debate.
- - has practical experience from team-based projects.
Kursusindhold
Introduction to Artificial Intelligence.
Problem solving by statespace search: We will analyse and implement
algorithms to find way through a maze, shortest paths between
cities, planning problems etc.
Design and implementation of a game: We will learn how a computer
plays chess, and we will implement our own chess-program, or other
game of your own choise. Game theory, algorithm analysis, data
structures.
Litteraturhenvisninger
Compenduim
Bemærkninger
Grading follows the official statutory order on the 7-point grading
scale.
Sidst opdateret
27. oktober, 2016
