Deadly Banquet Creating believable non-player characters

Examensarbete för kandidatexamen

Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.12380/245160
Download file(s):
File Description SizeFormat 
245160.pdfFulltext1.27 MBAdobe PDFView/Open
Type: Examensarbete för kandidatexamen
Bachelor Thesis
Title: Deadly Banquet Creating believable non-player characters
Authors: Sundling, Joakim
Axelsson, Gustav
Nilsson, Hampus
Dahlén, Tom
Wibergh, Karin
Carlsson, Mathias
Abstract: NPCs (non-player characters) in computer games are often very predictable and obviously artificial, which might be the result of developers devoting more resources to maintaining high-end graphics instead of creating believable NPCs. With the graphics available today already being very realistic, upgrading the AI (artificial intelligence) controlling the NPCs could be one way of creating a game that differs from the rest. This report documents the development of a game called Deadly Banquet, a murder mystery which focuses on the interaction between the player and the NPCs. All necessary building blocks for the AI which controls the NPCs are described, as well as the components for making the game framework. Further, diverse definitions of believability are discussed and an overview of methods for evaluating them is presented. Conclusions drawn from the project indicate the need for extensive memories for each NPC. They also indicate that using relations between NPC:s in decision-making could enhance their believability.
Keywords: Informations- och kommunikationsteknik;Data- och informationsvetenskap;Information & Communication Technology;Computer and Information Science
Issue Date: 2016
Publisher: Chalmers tekniska högskola / Institutionen för data- och informationsteknik (Chalmers)
Chalmers University of Technology / Department of Computer Science and Engineering (Chalmers)
URI: https://hdl.handle.net/20.500.12380/245160
Collection:Examensarbeten för kandidatexamen // Bachelor Theses



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.