{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:20Z","timestamp":1750308080232,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"95","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGART Bull."],"published-print":{"date-parts":[[1986,1]]},"abstract":"<jats:p>Several algorithms to play mastermind have been published. However, the overall complexity of the algorithm has not been discussed. In this paper, we present three algorithms and an analysis of their complexity.<\/jats:p>","DOI":"10.1145\/1056563.1056568","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"33-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms to play Mastermind"],"prefix":"10.1145","author":[{"given":"T. M.","family":"Rao","sequence":"first","affiliation":[{"name":"SUNY College, Brockport, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Kazin","sequence":"additional","affiliation":[{"name":"SUNY College, Brockport, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"O'Brien","sequence":"additional","affiliation":[{"name":"SUNY College, Brockport, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1986,1]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Rao T.M. No. 82 Oct. 1982 19--23  Rao T.M. No. 82 Oct. 1982 19--23","DOI":"10.1145\/1056602.1056607"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Gyllenskog J. No. 84 Apr. 1983 34--35  Gyllenskog J. No. 84 Apr. 1983 34--35","DOI":"10.1145\/1056623.1056626"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Shapiro E. No. 85 July 1983 28--29  Shapiro E. No. 85 July 1983 28--29","DOI":"10.1145\/1056635.1056637"},{"key":"e_1_2_1_4_1","first-page":"11","volume":"81","unstructured":"Koppenstein , No. 81 , Apr. 1984, 11 -- 14 Koppenstein, No. 81, Apr. 1984, 11--14","journal-title":"Koppenstein"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Rada R. No. 89 July 1984 24--25  Rada R. No. 89 July 1984 24--25","DOI":"10.1145\/1056521.1056523"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Powers D. M. W. No. 89 July 1984 28--32.  Powers D. M. W. No. 89 July 1984 28--32.","DOI":"10.1145\/1056521.1056526"}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056563.1056568","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1056563.1056568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:41Z","timestamp":1750262861000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056563.1056568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":6,"journal-issue":{"issue":"95","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["10.1145\/1056563.1056568"],"URL":"https:\/\/doi.org\/10.1145\/1056563.1056568","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1986,1]]},"assertion":[{"value":"1986-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}