Author:
Runarsson Thomas Philip,Merelo-Guervós Juan J.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Berghman, L., Goossens, D., Leus, R.: Efficient solutions for Mastermind using genetic algorithms. Computers and Operations Research 36(6), 1880–1885 (2009),
http://www.scopus.com/inward/record.url?eid=2-s2.0-56549123376&partnerID=40
2. Lecture Notes in Computer Science;J.L. Bernier,1996
3. Bestavros, A., Belal, A.: Mastermind, a game of diagnosis strategies. Bulletin of the Faculty of Engineering. Alexandria University (1986),
citeseer.ist.psu.edu/bestavros86mastermind.html
,
http://www.cs.bu.edu/fac/best/res/papers/alybull86.ps
4. Irving, R.W.: Towards an optimum mastermind strategy. Journal of Recreational Mathematics 11(2), 81–87 (1978-1979)
5. Kendall, G., Parkes, A., Spoerer, K.: A survey of NP-complete puzzles. ICGA Journal 31(1), 13–34 (2008),
http://www.scopus.com/inward/record.url?eid=2-s2.0-42949163946&partnerID=40
(Cited By (Since 1996) 1)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献