Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

How to Play Mastermind Without Game Master

S. Ikeda, Kazumasa Shinagawa

Published Jan 1, 2026• 3 citations
Publisher
DOI
10.1007/978-981-95-4839-2_9

Related papers

Quantum algorithm for Mastermind game

Xiaoming Sun

Science China Physics Mechanics and Astronomy•Oct 16, 2025•0 citations

Quantum algorithm for secret learning in Mastermind game

Wentao Qi, Yongzhen Xu, Shenggen Zheng +1 more

Science China Physics Mechanics and Astronomy•Nov 12, 2025•4 citations

Playing quantum games

Karmela Padavic-Callaghan

The New Scientist•Jul 1, 2026•0 citations

Playing games in quantum realm

Junichi Shimamura

•Mar 25, 2005•1 citation

Playing Mastermind on quantum computers

Lvzhou Li, Jingquan Luo, Yongzhen Xu

From the 1970s up to now, Mastermind, a classic two-player game, has attracted plenty of attention, not only from the public as a popular game, but also from the academic community as a scientific issue. Mastermind with n positions and k colors is formally described as: the codemaker privately chooses a secret $s\in [k]^n$, and the coderbreaker want to determine $s$ in as few queries like $f_s(x)$ as possible to the codemaker, where $f_s(x)$ indicates how x is close to s. The complexity of a strategy is measured by the number of queries used. In this work we study playing Mastermind on quantum computers in both non-adaptive and adaptive settings, obtaining efficient quantum algorithms which are all exact (i.e., return the correct result with certainty) and show huge quantum speedups. Technically, we develop a three-step framework for designing quantum algorithms for the general string learning problem, which not only allows huge quantum speedups on playing Mastermind, but also may shed light on exploring quantum speedups for other string learning problems.

arXiv:2207.09356•Jul 19, 2022•4 citations

How Well Do People Play a Quantum Prisoner’s Dilemma?

Kay‐Yut Chen, Tad Hogg

Quantum Information Processing•Feb 1, 2006•40 citations
From the 1970s up to now, Mastermind, a classic two-player game, has attracted plenty of attention, not only from the public as a popular game, but also from the academic community as a scientific issue. Mastermind with n positions and k colors is formally described as: the codemaker privately chooses a secret s∈[k]ns\in [k]^ns∈[k]n, and the coderbreaker want to determine sss in as few queries like fs(x)f_s(x)fs​(x) as possible to the codemaker, where fs(x)f_s(x)fs​(x) indicates how x is close to s. The complexity of a strategy is measured by the number of queries used. In this work we study playing Mastermind on quantum computers in both non-adaptive and adaptive settings, obtaining efficient quantum algorithms which are all exact (i.e., return the correct result with certainty) and show huge quantum speedups. Technically, we develop a three-step framework for designing quantum algorithms for the general string learning problem, which not only allows huge quantum speedups on playing Mastermind, but also may shed light on exploring quantum speedups for other string learning problems.