Using a SAT Solver to Find Interesting Sets of Nonstandard Dice

Abstract

Abstract We describe a family of Boolean satisfiability (SAT) problems for which each solution corresponds to a unique set of nonstandard dice. We show that we can control the relationships between the dice in each solution by imposing a set of cardinality constraints on the variables in the corresponding SAT problem. We then present examples of interesting sets of nonstandard dice that we found by solving such problems. In particular, we describe a set of 19 five-sided dice that realize the Paley tournament on 19 vertices. Furthermore, we show that this set of dice is minimal in the sense that no set of 19 dice with less than five sides can realize the Paley tournament on 19 vertices.