Population-Based FPGA Solution to Mastermind Game

@article{Ugurdag2006PopulationBasedFS,
  title={Population-Based FPGA Solution to Mastermind Game},
  author={H. Fatih Ugurdag and Yahya Sahin and Onur Baskirt and Soner Dedeoglu and Sezer G{\"o}ren and Yasar S. Kocak},
  journal={First NASA/ESA Conference on Adaptive Hardware and Systems (AHS'06)},
  year={2006},
  pages={237-246}
}
We present a new parallel, adaptable algorithm, which plays Mastermind game, and its FPGA implementation. The proposed algorithm is a cross between Shapiro's, Knuth's, and Kooi's algorithms, has low-computational complexity but still offers competitive game results. The FPGA design part required subtle architectural decisions and trade-off between areas, interconnect, and clock speed. An FPGA implementation provides a cheap and low-power engine for a console game while offering speeds even… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Ken, Unix and Games

  • D. Ritchie
  • ICGA Journal, The Universiteit Maastricht,
  • 2001
1 Excerpt

The Mastermind game and the rigidity of the Hamming space

  • G. Kabatianski, V. Lebedev, J. Thorpe
  • Proceedings of ISIT, Italy,
  • 2000
2 Excerpts

Cut the Knot! Invitation to Mastermind”, www.maa.org/editorial/knot /Mastermind.html

  • A. Bogomolny, D. Greenwell
  • 1999
2 Excerpts

The Value of Adaptive Questions in Generalized Mastermind

  • J. R. Roche
  • Proceedings of ISIT, Germany,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…