How to solve the "Mastermind" guessing game? (2009)

Re:How to solve the "Mastermind" guessing game? (2009) by wegfawefgawefg on Monday January 15, 2024 @01:14AM (#38997887)

You're framing it like an information extraction game, but it is also frameable as a zero-sum minimax game. And its an easy, and common solution to games like this. Read up.

https://en.wikipedia.org/wiki/Mastermind_(board_game)#Algori... https://en.wikipedia.org/wiki/Minimax#In_zero-sum_games

One of the early solutions to mastermind was by Donald Knuth. paper: https://www.cs.uni.edu/~wallingf/teaching/cs3530/resources/k... an implementation: https://github.com/johnathanlouie/mastermind

further development: https://arxiv.org/abs/1908.06183

[ Parent | on HN ]

Re:How to solve the "Mastermind" guessing game? (2009) by CyberDildonics on Monday January 15, 2024 @08:45AM (#39000898)

It just says the "minimax" solution for the person who chooses the pattern is to pick randomly from patterns with more than one color.

[ Parent | on HN ]

Re:How to solve the "Mastermind" guessing game? (2009) by wegfawefgawefg on Tuesday January 16, 2024 @01:46AM (#39010193)

Well the game is trivial for the person picking the pattern. So I dont expect the optimal play for them to be interesting.

[ Parent | on HN ]

Re:How to solve the "Mastermind" guessing game? (2009) by CyberDildonics on Tuesday January 16, 2024 @09:52AM (#39013869)

If the game is trivial for the person picking, what is the strategy for the player after the filtering I described?

[ Parent | on HN ]