no code implementations • 17 Apr 2014 • Thi-Van-Anh Nguyen, Arnaud Lallouet
In this paper we study complete search techniques and show that our solver using the compact representation of Constraint Games is faster than the classical game solver Gambit by one to two orders of magnitude.
