Using a SAT Solver to Find Interesting Sets of Nonstandard Dice

DOI10.1080/00029890.2023.2178218zbMath1530.68241MaRDI QIDQ6042554

Unnamed Author

Publication date: 11 May 2023

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial probability (60C05) Enumerative combinatorics (05A99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Directed graphs (digraphs), tournaments (05C20) Computational aspects of satisfiability (68R07) Computational methods for problems pertaining to combinatorics (05-08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multipartite version of the Turan problem - density conditions and eigenvalues
• PySAT: a Python toolkit for prototyping with SAT oracles
• Generating oriented graphs by means of team comparisons
• The Paradox of Nontransitive Dice
• Maximally Nontransitive Dice
• Balanced Nontransitive Dice
• A Direct Construction of Nontransitive Dice Sets
• Intransitive Dice
• Nontransitive Random Variables and Nontransitive Dice
• Theory and Applications of Satisfiability Testing

This page was built for publication: Using a SAT Solver to Find Interesting Sets of Nonstandard Dice