Bounding memory for Mastermind might not make it harder

DOI10.1016/J.TCS.2015.06.039MaRDI QIDQ2355703zbMATH OpenOpenAlexFDO

Authors Gerold Jäger, Marcin Peczarski

Publication date 24 July 2015

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2015.06.039

zbMATH Keywords

game theorylogic gameMastermindspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)

Recommendations

• Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
• Playing Mastermind with constant-size memory
• Playing mastermind with constant-size memory

Cites work

• scientific article; zbMATH DE number 3559318 (Why is no real title available?)
• scientific article; zbMATH DE number 599564 (Why is no real title available?)
• scientific article; zbMATH DE number 2061809 (Why is no real title available?)
• scientific article; zbMATH DE number 3194843 (Why is no real title available?)
• Mastermind
• On the algorithmic complexity of the Mastermind game with black-peg results
• Playing mastermind with constant-size memory
• Playing Mastermind with constant-size memory
• Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
• The number of pessimistic guesses in generalized black-peg mastermind
• The number of pessimistic guesses in Generalized Mastermind
• The worst case number of questions in generalized AB game with and without white-peg answers

Cited in

(6)

• The memory game
• Playing mastermind with constant-size memory
• Playing Mastermind with constant-size memory
• Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
• An optimal strategy for static black-peg Mastermind with two pegs
• The space complexity of mirror games

This page was built for publication: Bounding memory for Mastermind might not make it harder

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