Change search
ReferencesLink to record
Permanent link

Direct link
AI in Neverwinter Nights using Dynamic Scripting
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
2012 (English)Independent thesis Basic level (degree of Bachelor)Student thesis
Abstract [en]

In this paper research about dynamic scripting and the top culling difficulty scaling enhancement in the game Neverwinter Nights is investigated. A comparison between both a static and a dynamic opponent is made. The human opinion about dynamic scripting is also highlighted. To get an understanding of what the players think about and how they approach an opponent, two experiments were made. One where tests are made on a static opponent and a dynamic opponent, then a second where differences in behavior of the dynamic opponent using top culling and an ordinary dynamic opponent are analyzed. Results from the first test shows the static opponent is more preferable whereas the dynamic opponent using top culling is preferred in the second experiment. Since comparing the two experiments the results are ambiguous. The conclusion is that further investigation is needed in order to answer the question if human players prefer static or dynamic opponents when playing computer games.

Abstract [sv]

I detta arbete undersöks tekniken "Dynamic Scripting" och en metod för att skala svårigheten hos motståndare, kallad "Top Culling". Detta har testats i spelet "Neverwinter Nights". En jämförelse mellan en statisk och en dynamisk motståndare har gjorts där den mänskliga synen på dynamic scripting är en huvudfaktor. För att få förståelse hur spelare tänker och bemöter olika motstånd gjordes två experiment. I ett av experimenten testas en statisk och en dynamisk motståndare. I ett annat experiment görs en analys av skillnaderna i beteende mellan en dynamisk motståndare med svårighetsskalning och en dynamisk motståndare utan. Det första experimentet gav resultat som visar att den statiska motståndaren föredras medan i det andra experimentet föredras den dynamiska motståndaren som skalade sin svårighetsgrad. Slutsatsen är att vidare undersökning krävs för att kunna besvara frågan huruvida en spelare hellre vill möta en statisk eller en dynamisk motståndare.

Place, publisher, year, edition, pages
2012. , 19 p.
Keyword [en]
Reinforcement Learning, Dynamic Scripting, Top Culling
National Category
Computer Science Human Computer Interaction
URN: urn:nbn:se:bth-3911Local ID: diva2:831226
Available from: 2015-04-22 Created: 2012-07-06 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(851 kB)41 downloads
File information
File name FULLTEXT01.pdfFile size 851 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computing
Computer ScienceHuman Computer Interaction

Search outside of DiVA

GoogleGoogle Scholar
Total: 41 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

Total: 110 hits
ReferencesLink to record
Permanent link

Direct link