Year: 2018
Type: preprint
Abstract: In this paper we describe several player preferences in games with $N \geq 2$ players, in particular the case $N = 3$, and use them to simplify game trees, using the game of Clobber as our example. We show that, using a fixed starting player and a certain ruleset, any short game can be simplified to a value in a very concise set. Omitting the fixed starting player and generalising the theory to more than 3 players remains a challenge.
Source: arXiv (Cornell University)
Authors: Edixhoven, Luc, Kosters, Walter
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2807497660