top of page
Mastermind
Developed a program in C++ which would win a game of mastermind, with up to 15 colours and pegs, within ten seconds and in the fewest moves possible.
​
The final solution could solve a 15*15 mastermind setup ( potential combinations) in approximately 50 moves and included the use of two heuristic hill climbing algorithms as well as a timing mechanic to ensure the timing criteria was met.
​
Final program was one of the best in the year, with a particularly effective solution approaching higher combinations.

bottom of page