{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T04:38:35Z","timestamp":1727239115047},"reference-count":10,"publisher":"Informa UK Limited","issue":"5","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["The American Mathematical Monthly"],"published-print":{"date-parts":[[2024,5,27]]},"DOI":"10.1080\/00029890.2024.2308489","type":"journal-article","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T14:50:34Z","timestamp":1708613434000},"page":"390-399","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Playing Mastermind with Wordle-like Feedback"],"prefix":"10.1080","volume":"131","author":[{"given":"Renyuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenglong","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_3_2_1","DOI":"10.1145\/2987372"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_1","DOI":"10.3390\/g9010002"},{"doi-asserted-by":"crossref","unstructured":"Larcher M Martinsson A Steger A. Solving static permutation mastermind using O(n\u2009log\u2009n) queries. 2021. arXiv preprint arXiv:2103.02527.","key":"e_1_3_3_4_1","DOI":"10.37236\/10280"},{"unstructured":"Martinsson A Su P. Mastermind with a linear number of queries. 2020. arXiv preprint arXiv:2011.05921","key":"e_1_3_3_5_1"},{"unstructured":"Bertsimas D Paskov A. An exact and interpretable solution to Wordle. 2022. Available from: https:\/\/auction-upload-files.s3.amazonaws.com\/Wordle_Paper_Final.pdf.","key":"e_1_3_3_6_1"},{"doi-asserted-by":"publisher","key":"e_1_3_3_7_1","DOI":"10.1007\/s00283-022-10202-0"},{"key":"e_1_3_3_8_1","first-page":"19:1","volume-title":"Leibniz International Proceedings in Informatics","author":"Lokshtanov D","year":"2022","unstructured":"Lokshtanov D, Bernardo S. Wordle Is NP-Hard. In: Fraigniaud P, Uno Y, editors. Leibniz International Proceedings in Informatics. Vol. 226. Dagstuhl, Germany: Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik; 2022. p.19:1\u201319:8."},{"unstructured":"Rosenbaum W. Finding a winning strategy for Wordle is NP-complete. 2022. arXiv preprint arXiv:2204.04104.","key":"e_1_3_3_9_1"},{"doi-asserted-by":"crossref","unstructured":"Hamkins JD. Infinite Wordle and the mastermind numbers. 2022. arXiv preprint arXiv:2203.06804.","key":"e_1_3_3_10_1","DOI":"10.1002\/malq.202200049"},{"doi-asserted-by":"publisher","key":"e_1_3_3_11_1","DOI":"10.1112\/jlms\/s1-10.37.26"}],"container-title":["The American Mathematical Monthly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00029890.2024.2308489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,24]],"date-time":"2024-09-24T22:28:25Z","timestamp":1727216905000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00029890.2024.2308489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,5,27]]}},"alternative-id":["10.1080\/00029890.2024.2308489"],"URL":"https:\/\/doi.org\/10.1080\/00029890.2024.2308489","relation":{},"ISSN":["0002-9890","1930-0972"],"issn-type":[{"type":"print","value":"0002-9890"},{"type":"electronic","value":"1930-0972"}],"subject":[],"published":{"date-parts":[[2024,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":"2022-12-25","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-14","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}