754 research outputs found

    Measuring Control to Dynamically Induce Flow in Tetris.

    Get PDF
    Dynamic Difficulty Adjustment (DDA) is a set of techniques that aim to automatically adapt the difficulty of a video game based on the player’s performance. This paper presents a methodology for DDA using ideas from the theory of flow and case-based reasoning (CBR). In essence we are looking to generate game sessions with a similar difficulty evolution to previous game sessions that have produced flow in players with a similar skill level. We propose a CBR approach to dynamically assess the player’s skill level and adapt the difficulty of the game based on the relative complexity of the last game states. We develop a DDA system for Tetris using this methodology and show, in a experiment with 40 participants, that the DDA version has a measurable impact on the perceived flow using validated questionnaires.pre-print456 K

    Demystifying the educational benefits of different gaming genres

    Get PDF
    As research continues into the use of computer games for educational purposes, educators still appear reluctant to incorporate them into their teaching. One contributing factor to this reluctance is the lack of information regarding the benefits offered by the different games available today. These differences appear to have been largely overlooked by the academic community, resulting in a lack of information being made available to both the academic and education communities alike. Without this information, educators will find it difficult to determine whether a game will suit their teaching needs, and will continue to avoid using them. This paper studies a selection of games from several different genres, assessing each one in its ability to fulfil a set of previously identified requirements for a good educational resource. The results of the investigation showed that there were indeed strong differences between the genres, allowing for some suggestions to be made regarding their use in education, as well as leaving room for some interesting future work

    How Fast Can We Play Tetris Greedily With Rectangular Pieces?

    Get PDF
    Consider a variant of Tetris played on a board of width ww and infinite height, where the pieces are axis-aligned rectangles of arbitrary integer dimensions, the pieces can only be moved before letting them drop, and a row does not disappear once it is full. Suppose we want to follow a greedy strategy: let each rectangle fall where it will end up the lowest given the current state of the board. To do so, we want a data structure which can always suggest a greedy move. In other words, we want a data structure which maintains a set of O(n)O(n) rectangles, supports queries which return where to drop the rectangle, and updates which insert a rectangle dropped at a certain position and return the height of the highest point in the updated set of rectangles. We show via a reduction to the Multiphase problem [P\u{a}tra\c{s}cu, 2010] that on a board of width w=Θ(n)w=\Theta(n), if the OMv conjecture [Henzinger et al., 2015] is true, then both operations cannot be supported in time O(n1/2−ϔ)O(n^{1/2-\epsilon}) simultaneously. The reduction also implies polynomial bounds from the 3-SUM conjecture and the APSP conjecture. On the other hand, we show that there is a data structure supporting both operations in O(n1/2log⁥3/2n)O(n^{1/2}\log^{3/2}n) time on boards of width nO(1)n^{O(1)}, matching the lower bound up to a no(1)n^{o(1)} factor.Comment: Correction of typos and other minor correction

    Demystifying the Educational Benefits of Different Gaming Genres

    No full text
    As research continues into the use of computer games for educational purposes, educators still appear reluctant to incorporate them into their teaching. One contributing factor to this reluctance is the lack of information regarding the benefits offered by the different games available today. These differences appear to have been largely overlooked by the academic community, resulting in a lack of information being made available to both the academic and education communities alike. Without this information, educators will find it difficult to determine whether a game will suit their teaching needs, and will continue to avoid using them. This paper studies a selection of games from several different genres, assessing each one in its ability to fulfil a set of previously identified requirements for a good educational resource. The results of the investigation showed that there were indeed strong differences between the genres, allowing for some suggestions to be made regarding their use in education, as well as leaving room for some interesting future work

    Cognitive Architectures for Serious Games

    Get PDF
    This dissertation summarises a research path aimed at fostering the use of Cognitive Architectures in Serious Games research field. Cognitive Architectures are an embodiment of scientific hypotheses and theories aimed at capturing the mechanisms of cognition that are considered consistent over time and independent of specific tasks or domains. The theoretical approaches provided by the research in computational cognitive modelling have been used to formalise a methodological framework to guide researchers and experts in the game-based education sector in designing, implementing, and evaluating Serious Games. The investigation of cognitive processes involved during the game experience represents the fundamental step of the pro- posed approach. Two different case studies are described to discuss the possible use of the suggested framework. In the first case study, the aim was to design a modified version of the Tetris game with the intention of making the game more effective in training the visual-spatial skill called mental rotation. In the second scenario, the frame- work was used as a basis for creating an innovative persuasive game. This case study provides an example of adopting cognitive architectures for implementing a non-player character with human-like behaviour developed using targeted cognitive theories

    Rapid adaptation of video game AI

    Get PDF

    A Software Design Pattern Based Approach to Auto Dynamic Difficulty in Video Games

    Get PDF
    From the point of view of skill levels, reflex speeds, hand-eye coordination, tolerance for frustration, and motivations, video game players may vary drastically. Auto dynamic difficulty (ADD) in video games refers to the technique of automatically adjusting different aspects of a video game in real time, based on the player’s ability and emergence factors in order to provide the optimal experience to users from such a large demography and increase replay value. In this thesis, we describe a collection of software design patterns for enabling auto dynamic difficulty in video games. We also discuss the benefits of a design pattern based approach in terms of software quality factors and process improvements based on our experience of applying it in three different video games. Additionally, we present a semi-automatic framework to assist in applying our design pattern based approach in video games. Finally, we conducted a preliminary user study where a Post-Degree Diploma student at the University of Western Ontario applied the design pattern based approach to create ADD in two arcade style games

    On distinguishing epistemic from pragmatic action

    Get PDF
    We present data and argument to show that in Tetris-a real-time, interactive video game-certain cognitive and perceptual problems ore more quicktv, easily, and reliably solved by performing actions in the world than by performing com-putational actions in the head atone. We have found that some of the translations and rotations made by players of this video game are best understood as actions that use the world to improve cognition. These actions are not used to implement a plan, or to implement a reaction; they are used to change the world in order to simplify the problem-solving task. Thus, we distinguish pragmatic octions--actions performed to bring one physically closer to a goal-from epistemic actions-actions performed to uncover informatioan that is hidden or hard to compute mentally. To illustrate the need for epistemic actions, we first develop a standard information-processing model of Tetris cognition and show that it cannot explain performance data from human players of the game-even when we relax the assumption of fully sequential processing. Standard models disregard many actions taken by players because they appear unmotivated or superfluous. How-ever, we show that such actions are actually far from superfluous; they play a valuable role in improving human performance. We argue that traditional accounts are limited because they regard action as having o single function: to change the world. By recognizing a second function of action-an epistemic func-tion-we can explain many of the actions that a traditional model cannot. Al-though our argument is supported by numerous examples specifically from Tetris, we outline how the new category of epistemic action can be incorporated into theories of action more generally. In this article, we introduce the general idea of an epistemic action and discuss its role in Tetris, a real-time, interactive video game. Epistemic actions-physical actions that make mental computation easier, faster, or more We thank Steve Haehnichen for his work on the initial implementations of Tetris an

    Membangun Game Pembelajaran High Performance Computing (HPC) dengan Pendekatan Case-based Reasoning (CBR)

    Get PDF
    Badan ekonomi kreatif (BEKRAF) adalah badan yang menangani ekonomi kreatif di Indonesia yang dituntut untuk dapat meningkatkan pertumbuhan ekonomi kreatif nasional. Kepala BEKRAF mengungkapkan bahwa salah satu prioritas sector ekonomi kreatif yang akan dikembangkan adalah game. Oleh karena itu penelitian ini bertujuan untuk membangun sebuah game pembelajaran High Performance Computing atau HPC dengan pendekatan Case-based Reasoning (CBR). CBR merupakan metode untuk menyelesaikan masalah baru dengan membandingkan solusi dari masalah yang sama pada masa lampau. Tahapan metode penelitian ini diantaranya analisis, perancangan game (merancang game play), fitur game, dan elemen-elemen lain yang akan digunakan dalam game, perancangan system (merancang system game dengan UML), perancangan tampilan pengguna (User Interface), implementasi (berupa produk game)
    • 

    corecore