AIGTJul 15, 2014

Strategy Synthesis for General Deductive Games Based on SAT Solving

arXiv:1407.3926v23.01 citations
Originality Synthesis-oriented
AI Analysis

This work addresses the challenge of strategy synthesis in deductive games for researchers or practitioners, but it appears incremental as it builds on existing games without specifying broad applications.

The authors tackled the problem of modeling and solving deductive games, where one player hides a secret code and another tries to uncover it efficiently, by developing a general framework implemented in the Cobra software tool, which generated new results for existing games.

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.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes