Strategy Synthesis for General Deductive Games Based on SAT Solving

07/15/2014
by   Miroslav Klimos, et al.
0

We propose a general framework for modelling and solving deductive games, where one player selects a secret code and the other player strives to discover this code using a minimal number of allowed experiments that reveal some partial information about the code. The framework is implemented in a software tool Cobra, and its functionality is demonstrated by producing new results about existing deductive games.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/26/2023

With a little help from your friends: semi-cooperative games via Joker moves

This paper coins the notion of Joker games where Player 2 is not strictl...
research
07/21/2021

Finite-memory strategies in two-player infinite games

We study infinite two-player win/lose games (A,B,W) where A,B are finite...
research
07/20/2022

A Lattice-Theoretical View of Strategy Iteration

Strategy iteration is a technique frequently used for two-player games i...
research
03/17/2022

Optimal schemes for combinatorial query problems with integer feedback

A query game is a pair of a set Q of queries and a set ℱ of functions, o...
research
05/29/2021

Causality-Based Game Solving

We present a causality-based algorithm for solving two-player reachabili...
research
07/03/2023

Synthesising Full-Information Protocols

We lay out a model of games with imperfect information that features exp...
research
08/17/2023

RTB Formulation Using Point Process

We propose a general stochastic framework for modelling repeated auction...

Please sign up or login with your details

Forgot password? Click here to reset