Using a SAT Solver to Find Interesting Sets of Nonstandard Dice

DOI10.1080/00029890.2023.2178218MaRDI QIDQ6042554zbMATH OpenFDO

Authors

Publication date 11 May 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/00029890.2023.2178218

Mathematics Subject Classification ID

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

Recommendations

• A Direct Construction of Nontransitive Dice Sets
• scientific article; zbMATH DE number 6385270
• Properties of sets of nontransitive dice with few sides
• Balanced nontransitive dice
• Generalized intransitive dice. II: Partition constructions

Cites work

• A Direct Construction of Nontransitive Dice Sets
• A multipartite version of the Turan problem - density conditions and eigenvalues
• Balanced nontransitive dice
• Generating oriented graphs by means of team comparisons
• scientific article; zbMATH DE number 6385270 (Why is no real title available?)
• scientific article; zbMATH DE number 3136270 (Why is no real title available?)
• scientific article; zbMATH DE number 3154265 (Why is no real title available?)
• scientific article; zbMATH DE number 3217478 (Why is no real title available?)
• Intransitive dice
• Maximally nontransitive dice
• Nontransitive random variables and nontransitive dice
• PySAT: a Python toolkit for prototyping with SAT oracles
• The Paradox of 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042554)