Publisher
Springer International Publishing
Reference21 articles.
1. Asuncion, A.U., Goodrich, M.T.: Nonadaptive Mastermind algorithms for string and vector databases, with case studies. IEEE Trans. Knowl. Data Eng. 25(1), 131–144 (2013)
2. Chen, S.T., Lin, S.S.: Optimal algorithms for
$$2 \times n$$
AB games - a graph-partition approach. J. Inf. Sci. Eng. 20(1), 105–126 (2004)
3. Chen, S.T., Lin, S.S., Huang, L.T.: Optimal algorithms for
$$2 \times n$$
Mastermind games - a graph-partition approach. Comput. J. 47(5), 602–611 (2004)
4. Chvátal, V.: Mastermind. Combinatorica 3, 325–329 (1983)
5. Doerr, B., Spöhel, R., Thomas, H., Winzen, C.: Playing Mastermind with many colors. In: Proceedings of 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), SIAM, pp. 695–704 (2013)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献