TKO_5710 Algorithms for Computer Games 5 op
Organised by
Computer Science
Person in charge
Jouni Smed
Preceding studies
Previous knowledge on algorithms and data structures is highly recommended.

Learning outcomes

The course concentrates on algorithmic problems present in computer games. The aim of the course is to review common solution methods, analyse their usability, and describe possible improvements.

Contents

The topics cover among other things random numbers, game trees, path finding, terrain generation, and decision-making for synthetic players. The course focuses mainly on single player games, but the topics are extended to cover multiple players in the follow-up course Multiplayer Computer Games.

Teaching methods

Book exam

Modes of study

Option 1
Available for:
  • Degree Programme Students
  • Other Students
  • Doctoral Students
  • Exchange Students
Written exam
  • In English

Evaluation

Numeric 0-5.

Study materials

Chapters 1-7 from Jouni Smed and Harri Hakonen, Algorithms and Networking for Computer Games, John Wiley & Sons, 2006, ISBN 0-470-01812-7. http://www.wiley.com/go/smed

Belongs to following study modules

Tulevaisuuden teknologioiden laitos
Tulevaisuuden teknologioiden laitos
Tulevaisuuden teknologioiden laitos
Tulevaisuuden teknologioiden laitos
2016–2017
Teaching
Archived Teaching Schedule. Please refer to current Teaching Shedule.
Implementation details are unavailable.
Tulevaisuuden teknologioiden laitos
MDP in Bioinformatics
MDP in Embedded Computing
MDP in Digital Health and Life Sciences (Tech.)
Opintokokonaisuudet