English

SAT as a game

Computational Complexity 2015-11-04 v1 Artificial Intelligence

Abstract

We propose a funny representation of SAT. While the primary interest is to present propositional satisfiability in a playful way for pedagogical purposes, it could also inspire new search heuristics.

Cite

@article{arxiv.1511.00813,
  title  = {SAT as a game},
  author = {Olivier Bailleux},
  journal= {arXiv preprint arXiv:1511.00813},
  year   = {2015}
}
R2 v1 2026-06-22T11:35:26.721Z