The Burden of Choice, the Complexity of the World and Its Reduction: The Game of Go/Weiqi as a Practice of "Empirical Metaphysics

The main aim of the text is to show how a game of Go (Weiqi, baduk, Igo) can serve as a model representation of the ontological-metaphysical aspect of the actor–network theory (ANT). An additional objective is to demonstrate in return that this ontological-metaphys⁠ical aspect of ANT represented on Go/Weiqi game model is able to highlight the key aspect of this theory—onto-methodological praxis

Ludii -- The Ludemic General Game System

While current General Game Playing (GGP) systems facilitate useful research in Artificial Intelligence (AI) for game-playing, they are often somewhat specialised and computationally inefficient. In this paper, we describe the "ludemic" general game system Ludii, which has the potential to provide an efficient tool for AI researchers as well as game designers, historians, educators and practitioners in related fields. Ludii defines games as structures of ludemes -- high-level, easily understandable game concepts -- which allows for concise and human-understandable game descriptions. We formally describe Ludii and outline its main benefits: generality, extensibility, understandability and efficiency. Experimentally, Ludii outperforms one of the most efficient Game Description Language (GDL) reasoners, based on a propositional network, in all games available in the Tiltyard GGP repository. Moreover, Ludii is also competitive in terms of performance with the more recently proposed Regular Boardgames (RBG) system, and has various advantages in qualitative aspects such as generality.Comment: Accepted at ECAI 202

Capturing the Visitor Profile for a Personalized Mobile Museum Experience: an Indirect Approach

An increasing number of museums and cultural institutions around the world use personalized, mostly mobile, museum guides to enhance visitor experiences. However since a typical museum visit may last a few minutes and visitors might only visit once, the personalization processes need to be quick and efficient, ensuring the engagement of the visitor. In this paper we investigate the use of indirect profiling methods through a visitor quiz, in order to provide the visitor with specific museum content. Building on our experience of a first study aimed at the design, implementation and user testing of a short quiz version at the Acropolis Museum, a second parallel study was devised. This paper introduces this research, which collected and analyzed data from two environments: the Acropolis Museum and social media (i.e. Facebook). Key profiling issues are identified, results are presented, and guidelines towards a generalized approach for the profiling needs of cultural institutions are discussed

Regular Boardgames

We propose a new General Game Playing (GGP) language called Regular Boardgames (RBG), which is based on the theory of regular languages. The objective of RBG is to join key properties as expressiveness, efficiency, and naturalness of the description in one GGP formalism, compensating certain drawbacks of the existing languages. This often makes RBG more suitable for various research and practical developments in GGP. While dedicated mostly for describing board games, RBG is universal for the class of all finite deterministic turn-based games with perfect information. We establish foundations of RBG, and analyze it theoretically and experimentally, focusing on the efficiency of reasoning. Regular Boardgames is the first GGP language that allows efficient encoding and playing games with complex rules and with large branching factor (e.g.\ amazons, arimaa, large chess variants, go, international checkers, paper soccer).Comment: AAAI 201

Embedded non-interactive CAPTCHA for Fischer Random Chess.

Cheating in chess can take many forms and has existed almost as long as the game itself. The advent of computers has introduced a new form of cheating into the game. Thanks to the computational power of modern-day computers, a player can use a program to calculate thousands of moves for him or her, and determine the best possible scenario for each move and counter-move. These programs are often referred to as “bots,” and can even play the game without any user interaction. In this paper, we describe a methodology aimed at preventing bots from participating in online chess games. The proposed approach is based on the integration of a CAPTCHA protocol into a game scenario, and the subsequent inability of bots to accurately track the game states. Preliminary experimental results provide favorable feedback for further development of the proposed algorithm