{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T07:14:07Z","timestamp":1769757247219,"version":"3.49.0"},"reference-count":27,"publisher":"Informa UK Limited","issue":"5","license":[{"start":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:00:00Z","timestamp":1677024000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["The American Mathematical Monthly"],"published-print":{"date-parts":[[2023,5,28]]},"DOI":"10.1080\/00029890.2023.2178218","type":"journal-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T11:26:47Z","timestamp":1677065207000},"page":"421-436","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Using a SAT Solver to Find Interesting Sets of Nonstandard Dice"],"prefix":"10.1080","volume":"130","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6758-8027","authenticated-orcid":false,"given":"Michael","family":"Purcell","sequence":"first","affiliation":[{"name":"Software Innovation Institute, The Australian National University","place":["Canberra, Australia"]}]}],"member":"301","published-online":{"date-parts":[[2023,2,22]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.21563"},{"key":"e_1_3_3_3_1","first-page":"15","volume-title":"Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications","author":"Bednay D.","year":"2013","unstructured":"Bednay, D., Boz\u00f3ki, S. (2013). Constructions for nontransitive dice sets. In: Frank, A., Recski, A., Wiener, G., eds. Proceedings of the 8th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications. Budapest: BME VIK Sz\u00e1m\u00edt\u00e1studom\u00e1nyi \u00e9s Inform\u00e1ci\u00f3elm\u00e9leti Tansz\u00e9k, pp. 15\u201323."},{"issue":"14","key":"e_1_3_3_4_1","first-page":"240","article-title":"Nontransitive Roulette","volume":"3","author":"Bogdanov I. I.","year":"2010","unstructured":"Bogdanov, I. I. (2010). Nontransitive Roulette. Mat. Prosveshch. 3(14): 240\u2013255.","journal-title":"Mat. Prosveshch"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.18514\/MMN.2014.659"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2018.1427392"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.4169\/math.mag.89.2.133"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"e_1_3_3_9_1","volume-title":"Presented at the International Conference on Theory and Applications of Satisfiability Testing, 2005","author":"E\u00e9n N.","year":"2005","unstructured":"E\u00e9n, N., S\u00f6rensson, N. (2005). Minisat v1.13-a SAT solver with conflict-clause minimization. Presented at the International Conference on Theory and Applications of Satisfiability Testing, 2005."},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican1270-110"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/6648248"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-94144-8_26"},{"key":"e_1_3_3_13_1","unstructured":"Kjellerstrand H. (2010). Nontransitive dice ormat game 17x17 challenge. My Constraint Programming Blog. http:\/\/www.hakank.org\/constraint_programming_blog\/minizinc."},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2021.1889921"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_47"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1967.21.531"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.37236\/533"},{"key":"e_1_3_3_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"e_1_3_3_19_1","volume-title":"Presented at the AAAI-10 Conference on Artificial Intelligence","author":"O\u2019Sullivan B.","year":"2010","unstructured":"O\u2019Sullivan, B. (2010). Constraint programming and artificial intelligence: Challenges, applications, and opportunities. Presented at the AAAI-10 Conference on Artificial Intelligence, Atlanta, Georgia, USA. http:\/\/osullivan.ucc.ie\/AAAI_OSullivan.pdf."},{"key":"e_1_3_3_20_1","unstructured":"The Mathematical Association of America. (2005). Math Games: Tournament Dice. https:\/\/www.mathpuzzle.com\/MAA\/39-Tournament%20Dice\/mathgames_07_11_05.html"},{"key":"e_1_3_3_21_1","unstructured":"Polymath 13. (2017). The probability that a random triple of dice is transitive. https:\/\/polymathprojects.org."},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.2307\/2974903"},{"key":"e_1_3_3_23_1","unstructured":"Schaefer A. (2017). Balanced non-transitive dice II: tournaments. arXiv:1706.08986 [math.CO] Jun. 2017."},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.4169\/college.math.j.48.1.10"},{"key":"e_1_3_3_25_1","unstructured":"Soliman S. (2017). Constraint logic programming. https:\/\/lifeware.inria.fr\/\u223csoliman\/publi\/mpri_clp5.pdf."},{"key":"e_1_3_3_26_1","first-page":"67","article-title":"On a paradox in applied probabilities","volume":"7","author":"Steinhaus H.","year":"1959","unstructured":"Steinhaus, H., Trybu\u0142a, S. (1959). On a paradox in applied probabilities. Bull. Pol. Acad. Sci. Math. 7: 67\u201369.","journal-title":"Bull. Pol. Acad. Sci. Math"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.4064\/am-5-4-321-332"},{"key":"e_1_3_3_28_1","doi-asserted-by":"publisher","DOI":"10.4064\/am-8-2-143-156"}],"container-title":["The American Mathematical Monthly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00029890.2023.2178218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T16:57:13Z","timestamp":1769705833000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00029890.2023.2178218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,22]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5,28]]}},"alternative-id":["10.1080\/00029890.2023.2178218"],"URL":"https:\/\/doi.org\/10.1080\/00029890.2023.2178218","relation":{},"ISSN":["0002-9890","1930-0972"],"issn-type":[{"value":"0002-9890","type":"print"},{"value":"1930-0972","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,22]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uamm20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uamm20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-12-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-05-17","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-05-18","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}