of the game. After automatically detecting the board and playing pieces, we perform inference on the time series of detections to eliminate errors and accurately estimate long sequences of moves. The game transcript may be studied afterwards, shared with friends and teachers, or added to online compilations

This Thesis is brought to you for free and open access by BYU ScholarsArchive. It has been accepted for inclusion in All Theses and Dissertations by an authorized administrator of BYU ScholarsArchive. For more information, please contact scholarsarchive@byu.edu.

In this paper we describe a set of experiments for learning a the values of chess pieces for the popular chess variants crazyhouse, suicide, and atomic chess. We follow an established methodology that relies on reinforcement learning from self-games to learn piece values and piece-square tables

IncreTable is a mixed-reality tabletop game inspired by The Incredible Machine. Users can com-bine real and virtual game pieces in order to solve puzzles in the game. Game actions include placing virtual domino blocks with digital pens, controlling a virtual car by modifying the virtual terrain

Game playing theory is an important research branch of artificial intelligence. In this paper, we first describe how to build a game tree for five-piece chess game. Then, we introduce a maximin search algorithm in game tree to find the optimal playing strategy, and βα − pruning strategy to improve

The aim of this thesis is to explore how to join the social activity and fun of a board game, with computers' possibility to add simultaneous and continuous action, and sensors' abilities to detect changes in their environment. Thus the aim is to enrich board games, using ubiquitous

In this paper, a study is described which investigates differences in game experience between the use of iconic and symbolic tangibles in digital tabletop interaction. To enable this study, a new game together with two sets of play pieces (iconic and symbolic) was developed and used

Abstract Many research teams and individuals have computed endgame databases for the game of chess which use the distance-to-mate metric, enabling their software to forecast the number of moves remaining until the game is over. This is not the case for the game of checkers. Only one programming

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . INTRODUCTION How can we understand the common denominator of Pavlov's salivating dogs, an ale named Hobgoblin, a market in southern France, and the bargaining for lock access on the Mississippi River? Pavlov's dogs were presented with pieces of delicious sausage that undoubtedly made them salivate

Abstract- This paper deeribes a series of experiments using eo-evolution of artificial neural networks on a game called Kalah. The technique employed closely follows the one used by Chellapilla and Fogel to evolve the successful checkers program Anaconda. The esperiments aim to provide insight