Strategy Synthesis for General Deductive Games Based on SAT Solving
Artificial Intelligence
2015-06-22 v2 Computer Science and Game Theory
Abstract
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.
Keywords
Cite
@article{arxiv.1407.3926,
title = {Strategy Synthesis for General Deductive Games Based on SAT Solving},
author = {Miroslav Klimos and Antonin Kucera},
journal= {arXiv preprint arXiv:1407.3926},
year = {2015}
}
Comments
A preliminary version submitted to a conference