Playing Mastermind with Wordle-like Feedback

DOI10.1080/00029890.2024.2308489MaRDI QIDQ6506664arXivFDO

Authors Renyuan Li, Shenglong Zhu

Published in arXiv

Full work available at URL https://doi.org/10.1080/00029890.2024.2308489

Abstract: In this paper, we define a new code-breaking game called Clear Mastermind, combining two similar games -- Mastermind and Wordle. The only difference between Clear Mastermind and Mastermind is that the rule of giving more precise feedback in Wordle is applied in the former game. In Clear Mastermind, the feedback contains the positions of the letters the codebreaker guessed correctly and the positions of letters that appear in the answer but in different positions. Define $F(k,n)$ as the least guessing number that the codebreaker can find the answer in the Clear Mastermind with $n$ positions and $k$ colors. We present a proof that $F(k,n)=k$ in the case $klen$. In the case that $k=ccdotn,cin{N}^{\ast }$, we prove that $F(k,n)=c+n-1$. In other cases, we give a bound of $F(k,n)$.

This page was built for publication: Playing Mastermind with Wordle-like Feedback

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6506664)