Last update: Sun Mar 31 02:13:37 MDT 2019
@Article{Chen:2004:OAM,
author = "Shan-Tai Chen and Shun-Shii Lin",
title = "Optimal Algorithms for $2 \times n$ Mastermind Games
--- a Graph-Partition Approach",
journal = j-COMP-J,
volume = "47",
number = "5",
pages = "602--611",
month = sep,
year = "2004",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/47.5.602",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Jun 28 17:48:35 MDT 2005",
bibsource = "http://www.math.utah.edu/pub/tex/bib/compj2000.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_05/",
URL = "http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_05/470602.sgm.abs.html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_05/pdf/470602.pdf",
acknowledgement = ack-nhfb,
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
}