Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • harvard-cite-them-right
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
If It’s Fun, It’s Fun: Deep Reinforcement Learning In Unreal Tournament 2004
2018 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This thesis explores the perceived enjoyability of Deep Reinforcement learning AI agents (DeepRL agent) that strives towards optimality within the First Person Shooter game Unreal Tournament 2004 (UT2004). The DeepRL agent used in the experiments was created and then trained within this game against the AI agent which comes with the UT2004 game (known here as a trivial UT2004 agent). Through testing the opinions of participants who have played UT2004 deathmatches against both the DeepRL agent and the trivial UT2004agent, the data collected in two participant surveys shows that the DeepRL agent is more enjoyable to face than a trivial UT2004 agent. By striving towards optimality the DeepRL agent developed a behaviour which despite making the DeepRL agent a great deal worse atUT2004 than the trivial UT2004 agent was more enjoyable to face than the trivial UT2004agent. Considering this outcome the data suggests that DeepRL agents in UT2004 which are encouraged to strive towards optimality during training are “enjoyable enough” in order to be considered by game developers to be “good enough” when developing non-trivial opponents for games similar to UT2004. If the development time of a DeepRL agent is reduced or equal in comparison with the development time of a trivial agent then the DeepRL agent could hypothetically be preferable. 

Place, publisher, year, edition, pages
2018.
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:hb:diva-25539OAI: oai:DiVA.org:hb-25539DiVA, id: diva2:1567486
Available from: 2021-06-28 Created: 2021-06-16 Last updated: 2025-09-24Bibliographically approved

Open Access in DiVA

JA-uppsats 2018 KSAI 11(831 kB)233 downloads
File information
File name FULLTEXT01.pdfFile size 831 kBChecksum SHA-512
ef04e67652d75f3738361a471df2415c6b495a29d8db7c51c7b703ebf312feb7219ef8ce06e3605da27765e13b9f63ebf4efcc142d7f14066cb60102183e6513
Type fulltextMimetype application/pdf

Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 233 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 551 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • harvard-cite-them-right
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf