Optimal Algorithms for 2 [times] n Mastermind Games-a Graph-Partition Approach

Shan-Tai Chen, Shun-Shii Lin. Optimal Algorithms for 2 [times] n Mastermind Games-a Graph-Partition Approach. Comput. J., 47(5):602-611, 2004. [doi]

@article{ChenL04:19,
  title = {Optimal Algorithms for 2 [times] n Mastermind Games-a Graph-Partition Approach},
  author = {Shan-Tai Chen and Shun-Shii Lin},
  year = {2004},
  url = {http://www3.oup.co.uk/computer_journal/hdb/Volume_47/Issue_05/470602.sgm.abs.html},
  tags = {graph-rewriting, rewriting, partitioning, systematic-approach},
  researchr = {https://researchr.org/publication/ChenL04%3A19},
  cites = {0},
  citedby = {0},
  journal = {Comput. J.},
  volume = {47},
  number = {5},
  pages = {602-611},
}