Automated Solution for Mastermind Game
dc.contributor.advisor | Nagy, Dávid | |
dc.contributor.author | Shadman Yazdi, Ali | |
dc.contributor.department | DE--Informatikai Kar | hu_HU |
dc.date.accessioned | 2020-11-19T15:24:23Z | |
dc.date.available | 2020-11-19T15:24:23Z | |
dc.date.created | 2020-11-18 | |
dc.description.abstract | In this work, we have created an automated solution for the game Mastermind. Mastermind is a 2-player code breaking game; we used Knuth's algorithm to create automated solutions for the game. Knuth's algorithm can assure a win within five turns. We have talked about variations of Mastermind, and we have implemented Knuth's algorithm on them as well. We have used Python and Java programming languages to compare the variations of Mastermind and got interesting results. We have discussed the similarities and differences between game AI and standard AI and how they are used in computers. | hu_HU |
dc.description.course | Computer Science Engineering | hu_HU |
dc.description.degree | BSc/BA | hu_HU |
dc.format.extent | 41 | hu_HU |
dc.identifier.uri | http://hdl.handle.net/2437/298726 | |
dc.language.iso | en | hu_HU |
dc.subject | Artificial Intelligence | hu_HU |
dc.subject | Mastermind | hu_HU |
dc.subject | Game AI | hu_HU |
dc.subject | Knuth | hu_HU |
dc.subject | Minimax | hu_HU |
dc.subject.dspace | DEENK Témalista::Informatika | hu_HU |
dc.title | Automated Solution for Mastermind Game | hu_HU |