Table of Contents
Fetching ...

The Quality of Information: A Weighted Entropy Approach to Near-Optimal Mastermind

Serkan Gür

TL;DR

The paper introduces a weighted entropy framework for Mastermind, where feedback outcomes are assigned context-dependent utilities to form a weighted information gain objective. A fixed-weight heuristic and a stage-weighted variant are developed, with the latter employing per-turn weight vectors optimized via a GPU-accelerated genetic algorithm. Empirical results show the stage-weighted method achieving an average of $4.3488$ guesses (max $6$)—within $0.2\%$ of the theoretical optimum $4.3403$—and revealing interpretable strategic weight patterns, such as emphasis on specific feedback types during different turns. The work delivers near-optimal performance with computational efficiency comparable to one-step-ahead heuristics and provides complete reproducibility through public code and data, suggesting broad applicability to larger Mastermind variants and related combinatorial problems.

Abstract

This paper presents a novel class of information-theoretic strategies for solving the game of Mastermind, achieving state-of-the-art performance among known heuristic methods. The core contribution is the application of a weighted entropy heuristic, based on the Belis-Guias, u framework, which assigns context-dependent utility values to each of the possible feedback types. A genetic algorithm optimization approach discovers interpretable weight patterns that reflect strategic game dynamics. First, I demonstrate that a single, fixed vector of optimized weights achieves a remarkable 4.3565 average guesses with a maximum of 5. Building upon this, I introduce a stage-weighted heuristic with distinct utility vectors for each turn, achieving 4.3488 average guesses with a maximum of 6, approaching the theoretical optimum of 4.3403 by less than 0.2%. The method retains the computational efficiency of classical one-step-ahead heuristics while significantly improving performance through principled information valuation. A complete implementation and all optimized parameters are provided for full reproducibility.

The Quality of Information: A Weighted Entropy Approach to Near-Optimal Mastermind

TL;DR

The paper introduces a weighted entropy framework for Mastermind, where feedback outcomes are assigned context-dependent utilities to form a weighted information gain objective. A fixed-weight heuristic and a stage-weighted variant are developed, with the latter employing per-turn weight vectors optimized via a GPU-accelerated genetic algorithm. Empirical results show the stage-weighted method achieving an average of guesses (max )—within of the theoretical optimum —and revealing interpretable strategic weight patterns, such as emphasis on specific feedback types during different turns. The work delivers near-optimal performance with computational efficiency comparable to one-step-ahead heuristics and provides complete reproducibility through public code and data, suggesting broad applicability to larger Mastermind variants and related combinatorial problems.

Abstract

This paper presents a novel class of information-theoretic strategies for solving the game of Mastermind, achieving state-of-the-art performance among known heuristic methods. The core contribution is the application of a weighted entropy heuristic, based on the Belis-Guias, u framework, which assigns context-dependent utility values to each of the possible feedback types. A genetic algorithm optimization approach discovers interpretable weight patterns that reflect strategic game dynamics. First, I demonstrate that a single, fixed vector of optimized weights achieves a remarkable 4.3565 average guesses with a maximum of 5. Building upon this, I introduce a stage-weighted heuristic with distinct utility vectors for each turn, achieving 4.3488 average guesses with a maximum of 6, approaching the theoretical optimum of 4.3403 by less than 0.2%. The method retains the computational efficiency of classical one-step-ahead heuristics while significantly improving performance through principled information valuation. A complete implementation and all optimized parameters are provided for full reproducibility.

Paper Structure

This paper contains 24 sections, 4 equations, 4 tables, 1 algorithm.