{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:19Z","timestamp":1750308079862,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"82","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"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":[[1982,10]]},"abstract":"<jats:p>The game of Mastermind (INVICTA) is played by two persons. It is quite popular and claimed to be quite complex. Recently, we were interested in computerizing this game. This paper summarized the method we discovered and implemented. Our method uses a simple list data structure to represent the knowledge gained. The algorithm was programmed in Pascal on a Burrough B-6800 machine. Some experimental results are presented at the end of the paper.<\/jats:p>","DOI":"10.1145\/1056602.1056607","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"19-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["An algorithm to play the game of mastermind"],"prefix":"10.1145","author":[{"given":"T. Mahadeva","family":"Rao","sequence":"first","affiliation":[{"name":"SUNY College at Brockport, Brockport, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1982,10]]},"reference":[{"volume-title":"Problem Solving Methods in Artificial Intelligence","year":"1971","author":"Nilsson N.","key":"e_1_2_1_1_1"},{"volume-title":"Artificial Intelligence","year":"1977","author":"Winston P.H.","key":"e_1_2_1_2_1"},{"volume-title":"Lisp","year":"1981","author":"Winston P.H.","key":"e_1_2_1_3_1"}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056602.1056607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1056602.1056607","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\/1056602.1056607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":3,"journal-issue":{"issue":"82","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["10.1145\/1056602.1056607"],"URL":"https:\/\/doi.org\/10.1145\/1056602.1056607","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1982,10]]},"assertion":[{"value":"1982-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}