Dissertations / Theses on the topic 'Computer games in fiction'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Computer games in fiction.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Buckles, Mary Ann. "Interactive fiction : the computer storygame adventure /." Diss., Connect to 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1985. http://wwwlib.umi.com/cr/ucsd/fullcit?p8517895.
Full textOde, Jon. "Religion in computer games : Religious themes conveyed through an unorthodox medium." Thesis, Karlstads universitet, Avdelningen för humaniora och genusvetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-12064.
Full textNilsson, Jakob. "Berättelsens labyrinter : Interaktiv fiktion och dess narrativa aspekter." Thesis, Södertörns högskola, Institutionen för genus, kultur och historia, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:sh:diva-15297.
Full textMagnuson, Markus Amalthea. "The Dig : De grafiska äventyrsspelen som flyktigt medium." Thesis, Stockholms universitet, Filmvetenskapliga institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-179044.
Full textAli, Ahmad, and Svensson Marcus. "Animation through Body Language : A study using the fictional character Mokhtar." Thesis, Uppsala universitet, Institutionen för speldesign, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-297660.
Full textNilsson, Christian. "Berättande simuleringar : Om datorspel och lärande i GY11:s litteraturundervisning." Thesis, Högskolan för lärande och kommunikation, Högskolan i Jönköping, Medie-, litteratur- och språkdidaktik, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-15343.
Full textThe purpose of this thesis is to discuss whether and how computer games can be used as fiction in literature education in accordance with the new Swedish gymnasium curriculums, GY11. The focus is on the contact points between computer games and fiction regarding learning; foremost building identities, morality and ethics, but also stylistics and concepts in literary science. It is show that, using two examples (Fallout: New Vegas and Grand Theft Auto IV), the narrative elements in computer games can give them room and literary education, and also that immersion, perspective and interactivity can give players something that fiction can’t give its readers.
Stenberg, Peder. "Den allvarsamma leken : Om World of Warcraft och läckaget." Doctoral thesis, Umeå universitet, Institutionen för kultur- och medievetenskaper, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-42073.
Full textPapargyriou, Eleni. "Reading games in twentieth-century Greek fiction." Thesis, University of Oxford, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433282.
Full textGoggin, Joyce. "The big deal, card games in 20th-century fiction." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0006/NQ35594.pdf.
Full textVedrashko, Ilya. "Advertising in computer games." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/39144.
Full textIncludes bibliographical references (leaves [67]-[74]).
This paper suggests advertisers should experiment with in-game advertising to gain skills that could become vital in the near future. It compiles, arranges and analyzes the existing body of academic and industry knowledge on advertising and product placement in computer game environments. The medium's characteristics are compared to other channels' in terms of their attractiveness to marketers, and the business environment is analyzed to offer recommendations on the relative advantages of in-game advertising. The paper also contains a brief historical review of in-game advertising, and descriptions of currently available and emerging advertising formats. Keywords: Advertising, marketing, branding, product placement, branded entertainment, networks, computer games, video games, virtual worlds.
by Ilya Vedrashko.
S.M.
Плохута, Тетяна Миколаївна, Татьяна Николаевна Плохута, Tetiana Mykolaivna Plokhuta, and B. S. Ilchyshyn. "Computer games and reality." Thesis, Вид-во СумДУ, 2007. http://essuir.sumdu.edu.ua/handle/123456789/17551.
Full textYan, Jingjing. "Gender and computer games / video games : girls’ perspective orientation." Thesis, Gotland University, Institutionen för humaniora och samhällsvetenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:hgo:diva-575.
Full textThe topic of this thesis is “Gender Differences in Computer games/ Video games Industry”. Due to rapid development in technology and popularization of computers all around the world, computer games have already become a kind of common entertainment. Because computer games were designed especially for boys at the very beginning, there are still some remaining barriers when training female game designers and expanding game markets among female players.This thesis is mainly based on two studies which have enormous contributions to gender issue in computer games area. A simple model is established by summarizing factors mentioned and discussed in those two books. The main purpose consists of two comparisons under Gender Differences: one comparison is between the current data with the previous one, in order to check whether there are any changes during the past 10 years. The other one compares the young people in two regions, Sweden and China, in computer games perspective.Model designing, test, questionnaire and interview methods are used in this paper aiming to collect and categorize the data, which facilitates to analyze the results of the comparisons. The results reflect that although computer becomes a familiar “friend” in modern daily life, there are not obvious changes of girls‟ perspectives in computer game industry. Certainly, there are some differences between the young people coming from two regions which will be expounded in the thesis.
Rihan, Jonathan. "Computer vision based interfaces for computer games." Thesis, Oxford Brookes University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.579554.
Full textGélinas, Faucher Claudine. "Beautiful Games: alienation, autonomy and authenticity in Leonard Cohen's fiction." Thesis, Connect to online version, 2007. http://proquest.umi.com/pqdweb?did=1441260261&sid=3&Fmt=2&clientId=10306&RQT=309&VName=PQD.
Full textLøland, Karl Syvert. "Intelligent agents in computer games." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9759.
Full textIn this project we examine whether or not a intelligent agent can learn how to play a computer game using the same inputs and outputs as a human. An agent architecture is chosen, implemented, and tested on a standard first person shooter game to see if it can learn how to play that game and find a goal in that game. We conclude the report by discussing potential improvements to the current implementation.
Nordvall, Mathias. "SIGHTLENCE : Haptics for Computer Games." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-73873.
Full textThomson, Matthew Ian Malcolm. "Military computer games and the new American militarism : what computer games teach us about war." Thesis, University of Nottingham, 2009. http://eprints.nottingham.ac.uk/10672/.
Full textMalmhake, Daniel, and Henrik Karlsson. "Natural Language Interface technology in computer games : AN EVALUATION OF NATURAL LANGUAGE PARSERS IN COMPUTER GAMES." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166411.
Full textEtt Natural Language Interface är ett gränssnitt som tar indata i form av språk istället för detvanliga sättet med tangentbord och mus. Ett Natural Language Interface fungerar genom attdet först tar ut satsdelarna i indatan, och sedan omvandlar dessa satsdelar till logiska uttrycksom kan bearbetas. Effektiviteten och användbarheten hos Natural Language Interfacesjämfördes med det normala sättet att få indata i form av tangentbord och mus. Dettagenomfördes genom att testanvändare spelade ett spel med Natural Language Interface ochsedan köra deras använda indata genom en semantic parser. Resultaten indikerar att NaturalLanguage Interface i sitt nuvarande tillstånd är ett mindre effektivt sätt att få indata än detvanliga sättet med tangentbord och mus.
Günzel, Stephan, Michael Liebe, and Dieter Mersch. "The medial form of computer games." Universität Potsdam, 2009. http://opus.kobv.de/ubp/volltexte/2009/3324/.
Full textLiboriussen, Bjarke. "The landscape aesthetics of computer games." Universität Potsdam, 2008. http://opus.kobv.de/ubp/volltexte/2008/2458/.
Full textHobro, Mark, and Marcus Heine. "Natural Language Interfaces in Computer Games." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166592.
Full textCoggan, Melanie. "Reinforcement learning in commercial computer games." Thesis, McGill University, 2008. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=112391.
Full textWe have created three experimental bots: ChaserBot, ItemBot and HybridBot. The two first bots each focus on a different aspect of the first-person shooter genre, and learn using basic RL. ChaserBot learns to chase down and shoot an enemy player. ItemBot, on the other hand, learns how to pick up the items---weapons, ammunition, armor---that are available, scattered on the ground, for the players to improve their arsenal. Both of these bots become reasonably proficient at their assigned task. Our goal for the third bot, HybridBot, was to create a bot that both chases and shoots an enemy player and goes after the items in the environment. Unlike the two previous bots which only have primitive actions available (strafing right or left, moving forward or backward, etc.), HybridBot uses options. At any state, it may choose either the player chasing option or the item gathering option. These options' internal policies are determined by the data learned by ChaserBot and ItemBot. HybridBot uses reinforcement learning to learn which option to pick at a given state.
Each bot learns to perform its given tasks. We compare the three bots' ability to gather items, and ChaserBot's and HybridBot's ability to chase their opponent. HybridBot's results are of particular interest as it outperforms ItemBot at picking up items by a large amount. However, none of our experiments yielded bots that are competitive with human players. We discuss the reasons for this and suggest improvements for future work that could lead to competitive reinforcement learning bots.
Gibson, Benjamin Ian. "Educational Games for Teaching Computer Science." Thesis, University of Canterbury. Computer Science and Software Engineering, 2013. http://hdl.handle.net/10092/9239.
Full textChaperot, Benoit. "Computational intelligence applied to computer games." Thesis, University of the West of Scotland, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.739387.
Full textWacher, Elin Gunnarsdottir. "COMPUTER GAMES AND THE OLDER GENERATION." Thesis, Malmö högskola, Fakulteten för hälsa och samhälle (HS), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-25230.
Full textShi, Yinxuan. "Procedural Content Generation for Computer Games." The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1469147321.
Full textPrechtl, Anthony. "Adaptive music generation for computer games." Thesis, Open University, 2016. http://oro.open.ac.uk/45340/.
Full textChan, Siu Man. "Pebble Games and Complexity." Thesis, University of California, Berkeley, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=3593787.
Full textWe study the connection between pebble games and complexity.
First, we derive complexity results using pebble games. It is shown that three pebble games used for studying computational complexity are equivalent: namely, the two-person pebble game of Dymond-Tompa, the two-person pebble game of Raz-McKenzie, and the one-person reversible pebble game of Bennett have the same pebble costs over any directed acyclic graph. The three pebble games have been used for studying parallel complexity and for proving lower bounds under restricted settings, and we show one more such lower bound on circuit-depth.
Second, the pebble costs are applied to proof complexity. Concerning a family of unsatisfiable CNFs called pebbling contradictions, the pebble cost in any of the pebble games controls the scaling of some parameters of resolution refutations. Namely, the pebble cost controls the minimum depth of resolution refutations and the minimum size of tree-like resolution refutations.
Finally, we study the space complexity of computing the pebble costs and of computing the minimum depth of resolution refutations. It is PSPACE-complete to compute the pebble cost in any of the three pebble games, and to compute the minimum depth of resolution refutations.
Mubireek, Khalid Al. "Gender-oriented vs. gender-neutral computer games in education." Connect to this title online, 2003. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1056139090.
Full textTitle from first page of PDF file. Document formatted into pages; contains xi, 120 p.; also includes graphics Includes bibliographical references (p. 101-106). Available online via OhioLINK's ETD Center
Kimmel, Jason. "Simple Games on Networks." Oberlin College Honors Theses / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1307994412.
Full textCaldwell, Nicholas Peter. "How civilized! : discourses in modernity and postmodernity in the computer strategy game /." St. Lucia, Qld, 2001. http://www.library.uq.edu.au/pdfserve.php?image=thesisabs/absthe16691.pdf.
Full textKeijser, Robin. "Popularity of Indie Games." Thesis, Högskolan i Gävle, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-17156.
Full textWalls, Richard. "Using Computer Games to Teach Social Studies." Thesis, Uppsala universitet, Institutionen för pedagogik, didaktik och utbildningsstudier, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-183039.
Full textMessing, Andreas, and Henrik Rönnholm. "Scalability of dynamic locomotion for computer games." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166424.
Full textDynamisk förflyttning i datorspel blir allt vanligare, menär fortfarande i sin vagga. I denna rapport genomför vi enutredning om ifall oscillatorer i form av ett CPG-systemkan användas som en spelteknik för att generera dynamiskrörelse i realtid. Vi testade detta genom att använda enfysiksimulator av industrikvalitet för att simulera en tvåfotingoch en fyrfoting (humanoid och salamander) och mätakvalitet, tidsåtgång och minnesanvändning . Försöken visaratt en tvåfoting behöver något sorts balanssystem för attgå längre sträckor, medan salamandern lyckades gå med endastmindre defekter. Minnet tillåter flera tusen instansermedan tidsåtgången tillåter upp till ett par hundra instanser.Detta leder till slutsatsen att det är ett billigt system lämpligtdär antalet instanser är viktigare än kvaliteten.
Manzaneda, Martin. "Natural Language Interface Technology in Computer Games." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166647.
Full textGunder, Anna. "Hyperworks : on digital literature and computer games /." Uppsala : Avd. för litteratursociologi vid Litteraturvetenskapliga institutionen i Uppsala, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-4517.
Full textChe, Pee Naim. "Computer games use in an educational system." Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/12297/.
Full textFrazer, Alex. "Towards better gameplay in educational computer games." Thesis, University of Southampton, 2010. https://eprints.soton.ac.uk/172421/.
Full textSundin, Olle. "Natural Language Content Generation for Computer Games." Thesis, Umeå universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-165091.
Full textHearn, Robert A. (Robert Aubrey) 1965. "Games, puzzles, and computation." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/37913.
Full textIncludes bibliographical references (p. 147-153).
There is a fundamental connection between the notions of game and of computation. At its most basic level, this is implied by any game complexity result, but the connection is deeper than this. One example is the concept of alternating nondeterminism, which is intimately connected with two-player games. In the first half of this thesis, I develop the idea of game as computation to a greater degree than has been done previously. I present a general family of games, called Constraint Logic, which is both mathematically simple and ideally suited for reductions to many actual board games. A deterministic version of Constraint Logic corresponds to a novel kind of logic circuit which is monotone and reversible. At the other end of the spectrum, I show that a multiplayer version of Constraint Logic is undecidable. That there are undecidable games using finite physical resources is philosophically important, and raises issues related to the Church-Turing thesis. In the second half of this thesis, I apply the Constraint Logic formalism to many actual games and puzzles, providing new hardness proofs. These applications include sliding-block puzzles, sliding-coin puzzles, plank puzzles, hinged polygon dissections, Amazons, Kohane, Cross Purposes, Tip over, and others.
(cont.) Some of these have been well-known open problems for some time. For other games, including Minesweeper, the Warehouseman's Problem, Sokoban, and Rush Hour, I either strengthen existing results, or provide new, simpler hardness proofs than the original proofs.
by Robert Aubrey Hearn.
Ph.D.
Manurangsi, Pasin. "On approximating projection games." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100635.
Full textThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 99-105).
The projection games problem (also known as LABEL COVER) is a problem of great significance in the field of hardness of approximation since almost all NP-hardness of approximation results known today are derived from the NP-hardness of approximation of projection games. Hence, it is important to determine the exact approximation ratio at which projection games become NP-hard to approximate. The goal of this thesis is to make progress towards this problem. First and foremost, we present a polynomial-time approximation algorithm for satisfiable projection games, which achieves an approximation ratio that is better than that of the previously best known algorithm. On the hardness of approximation side, while we do not have any improved NP-hardness result of approximating LABEL COVER, we show a polynomial integrality gap for polynomially many rounds of the Lasserre SDP relaxation for projection games. This result indicates that LABEL COVER might indeed be hard to approximate to within some polynomial factor. In addition, we explore special cases of projection games where the underlying graphs belong to certain families of graphs. For planar graphs, we present both a subexponential-time exact algorithm and a polynomial-time approximation scheme (PTAS) for projection games. We also prove that these algorithms have tight running times. For dense graphs, we present a subexponential-time approximation algorithm for LABEL COVER. Moreover, if the graph is a sufficiently dense random graph, we show that projection games are easy to approximate to within any polynomial ratio.
by Pasin Manurangsi.
M. Eng.
Cai, Yang Ph D. Massachusetts Institute of Technology. "The complexity of Nash equilibria in multiplayer zero-sum games and coordination games." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/62458.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 47-48).
We prove a generalization of von Neumann's minmax theorem to the class of separable multiplayer zero-sum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix-that is, graphical games in which every edge is a two-player game between its endpoints-in which every outcome has zero total sum of players' payoffs. Our generalization of the minmax theorem implies convexity of equilibria, polynomial-time tractability, and convergence of no-regret learning algorithms to Nash equilibria. Given that three player zero-sum games are already PPAD-complete, this class of games, i.e. with pairwise separable utility functions, defines essentially the broadest class of multi-player constants sum games to which we can hope to push tractability results. Our result is obtained by establishing a certain game-class collapse, showing that separable constant-sum games are payoff equivalent to pairwise constant-sum polymatrix games-polymatrix games in which all edges are constant-sum games, and invoking a recent result of [Daskalakis, Papadimitriou 2009] for these games. We also explore generalizations to classes of non- constant-sum multi-player games. A natural candidate is polymatrix games with strictly competitive games on their edges. In the two player setting, such games are minmax solvable and recent work has shown that they are merely affine transformations of zero-sum games [Adler, Daskalakis, Papadimitriou 2009]. Surprisingly we show that a polymatrix game comprising of strictly competitive games on its edges is PPAD-complete to solve, proving a striking difference in the complexity of networks of zero-sum and strictly competitive games. Finally, we look at the role of coordination in networked interactions, studying the complexity of polymatrix games with a mixture of coordination and zero-sum games. We show that finding a pure Nash equilibrium in coordination-only polymatrix games is PLS-complete; hence, computing a mixed Nash equilibrium is in PLS n PPAD, but it remains open whether the problem is in P. If, on the other hand, coordination and zero-sum games are combined, we show that the problem becomes PPAD-complete, establishing that coordination and zero-sum games achieve the full generality of PPAD. This work is done in collaboration with Costis Daskalakis.
by Yang Cai.
S.M.
Kaiser, David Michael. "The Structure of Games." FIU Digital Commons, 2007. http://digitalcommons.fiu.edu/etd/2.
Full textDelbecque, Yannick. "Quantum games as quantum types." Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=40670.
Full textNous présentons dans cette thèse un nouveau modèlepour les langages de programmation quantique. Notre modèle est uneadaptation de la sémantique de jeux probabilistes définie par Danos etHarmer: nous y ajoutons des stratégies quantiquespour permettre la représentation des états et des opérations quantiques.Nous établissons quelques propriétés de base de ces stratégies. Cespropriétés sont ensuite utilisées pour construire des sémantiquesdénotationnelles pour trois langages de programmation quantique. Le premierlangage est une formalisation du calcul par mesures proposé par Danoset al. Les deux autres langages sont nouveaux: ce sont deslangages quantiques d'ordre supérieur dont la syntaxe a été construiteà partir d'observations expliquant l'échec des tentatives précédentespour construire une sémantique dénotationnelle pour de tels langages. La sémantique de jeux présentée dans cette thèseest la première sémantique dénotationnelle pour de telslambda-calculs équipés de types et d'opérations supplémentairespermettant la programmation d'algorithmes quantiques. Les résultatsprésentés valident les deux approches différentes utilitées dans laconception de ces deux nouveaux languages d'ordre supérieur: une premièreoù les états quantiques sont indirectement accessibles via desréférences et une seconde où ils sont introduit directement comme desconstantes dans le langage. Les stratégies quantiques présentéespermettent de comprendre les contraintes devant êtreimposées aux systèmes de type quantique comportant des types d'ordresupérieurs. La contrainte la plus importante est le fait que l'abstractionsur une partie d'un état quantique comportant plusieurs qbits inconnus doitêtre prohibée. Les stratégies quantiques constituent un nouveau modèle mathématique quidécrit l'interaction entre les données classiques et quantiques par desdialogues entre système et environnement. L'interaction entre les differentespar
Holmgren, Johan, and Mikael Stewén. "Serious games med rökdykningssimulering." Thesis, Växjö University, School of Mathematics and Systems Engineering, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-1312.
Full textUtbildning och träning av rökdykning inom räddningtjänsten är idag både dyrt och
tidskrävande. Vid praktisk träning måste räddningstjänsten bege sig ut till befintliga
övningsområden och ta med sig en stor mängd utrustning: luftpaket, skyddskläder, radio etc. Detta gör det till ett omfattande och kostsamt moment. Detta öppnar tankebanor för alternativ och komplement till befintlig utbildning och träning.
Serious games finns idag i många former och är ett utbildnings och rekryteringsredskap som bygger på datorstödd inlärning. Med detta menas att ett Serious game är ett spel som har som huvudsyfte att lära ut och om möjlighet vara underhållande under tiden. Man kan genom denna teknik simulera verkliga situationer i realistiska miljöer med hjälp av verklighetsliknande kommunikationsprotokoll. Denna studie handlar om vilka huvudsakliga faktorer som är viktiga för ett Serious game. Vidare undersöks på vilket sätt ett Serious game
ska anpassas för svensk Räddningstjänst med inriktning på sökning och kommunikation vid rökdykningsträning och utbildning.
Vi har kommit fram till att följande huvudsakliga faktorer är viktiga för ett Serious game som är inriktat på förstapersonsimulering: Utvärdering, administration, grafik, underhållning, tutorials och dynamik. Vi har även kommit fram till att vid utveckling av en träningssimulator för rökdykning bör man använda befintliga inlärningsteorier, SDK som utvecklingsverktyg.
Denna studie öppnar även möjligheter för andra att fortsätta och genomföra utveckling av en riktig prototyp till Räddningstjänsten, utifrån våra resultat. Studien kan också ses som enklare underlag vid skapandet av ett Serious game av typen förstapersonsimulator.
Liebe, Michael. "There is no magic circle : on the difference between computer games and traditional games." Universität Potsdam, 2008. http://opus.kobv.de/ubp/volltexte/2008/2459/.
Full textRören, Jonas. "Best of Both Worlds: A Platform for Hybrids of Computer Games and Board Games." Thesis, Malmö högskola, Institutionen för konst, kultur och kommunikation (K3), 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-22398.
Full textBenkar, Rohan Sudhir. "Configurable Persuasive Games." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1373323538.
Full textHillman, Joel. "Kinect in retro games." Thesis, Blekinge Tekniska Högskola, Sektionen för datavetenskap och kommunikation, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5201.
Full textYuen, Jeanne Y. Y. "Computer Go-Muku." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=64063.
Full text