An experimental study of exhaustive solutions for the Mastermind puzzle

07/05/2012
by   J. J. Merelo, et al.
0

Mastermind is in essence a search problem in which a string of symbols that is kept secret must be found by sequentially playing strings that use the same alphabet, and using the responses that indicate how close are those other strings to the secret one as hints. Although it is commercialized as a game, it is a combinatorial problem of high complexity, with applications on fields that range from computer security to genomics. As such a kind of problem, there are no exact solutions; even exhaustive search methods rely on heuristics to choose, at every step, strings to get the best possible hint. These methods mostly try to play the move that offers the best reduction in search space size in the next step; this move is chosen according to an empirical score. However, in this paper we will examine several state of the art exhaustive search methods and show that another factor, the presence of the actual solution among the candidate moves, or, in other words, the fact that the actual solution has the highest score, plays also a very important role. Using that, we will propose new exhaustive search approaches that obtain results which are comparable to the classic ones, and besides, are better suited as a basis for non-exhaustive search strategies such as evolutionary algorithms, since their behavior in a series of key indicators is better than the classical algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/26/2023

Can You Solve Closest String Faster than Exhaustive Search?

We study the fundamental problem of finding the best string to represent...
research
12/12/2009

Adapting Heuristic Mastermind Strategies to Evolutionary Algorithms

The art of solving the Mastermind puzzle was initiated by Donald Knuth a...
research
03/27/2020

Rolling Horizon Evolutionary Algorithms for General Video Game Playing

Game-playing Evolutionary Algorithms, specifically Rolling Horizon Evolu...
research
06/19/2023

Efficient Parameterized Pattern Matching in Sublinear Space

The parameterized matching problem is a variant of string matching, whic...
research
01/16/2021

Strings-and-Coins and Nimstring are PSPACE-complete

We prove that Strings-and-Coins – the combinatorial two-player game gene...
research
11/14/2012

A Comparison of Meta-heuristic Search for Interactive Software Design

Advances in processing capacity, coupled with the desire to tackle probl...

Please sign up or login with your details

Forgot password? Click here to reset