3 ms·
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 t
by wegfawefgawefg 3y ago
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)#Algorithms_and_strategies https://en.wikipedia.org/wiki/Mastermind_(board_game)#Algori...
https://en.wikipedia.org/wiki/Minimax#In_zero-sum_games 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/knuth-mastermind.pdf https://www.cs.uni.edu/~wallingf/teaching/cs3530/resources/k...
an implementation:
https://github.com/johnathanlouie/mastermind https://github.com/johnathanlouie/mastermind
further development:
https://arxiv.org/abs/1908.06183 https://arxiv.org/abs/1908.06183
- CyberDildonics 3y agoIt just says the "minimax" solution for the person who chooses the pattern is to pick randomly from patterns with more than one color.
- wegfawefgawefg 3y agoWell the game is trivial for the person picking the pattern. So I dont expect the optimal play for them to be interesting.
- CyberDildonics 3y agoIf the game is trivial for the person picking, what is the strategy for the player after the filtering I described?