Author:
Bonnet François,Viennot Simon
Publisher
Springer International Publishing
Reference14 articles.
1. Chen, S.T., Lin, S.S.: Optimal algorithms for $$2\times n$$ mastermind games-a graph-partition approach. Comput. J. 47, 602–611 (2004)
2. Chvátal, V.: Mastermind. Combinatorica 3, 325–329 (1983)
3. Doerr, B., Sphel, R., Thomas, H., Winzen, C.: Playing mastermind with many colors. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 695–704 (2013)
4. Goddard, W.: Static mastermind. J. Comb. Math. Comb. Comput. 47, 225–236 (2003)
5. Goddard, W.: Mastermind revisited. J. Comb. Math. Comb. Comput. 51, 215–220 (2004)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献