EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Mastermind"
Narrow search

Narrow search

Year of publication
Subject
All
Mastermind 4 permutation 4 algorithm 2 combinatorial problem 2 complexity 2 query complexity 2 Algorithm 1 Algorithmus 1 Complex systems 1 Complexity management 1 Komplexe Systeme 1 Komplexitätsmanagement 1 Theorie 1 Theory 1
more ... less ...
Online availability
All
Free 4 CC license 1
Type of publication
All
Article 4
Type of publication (narrower categories)
All
Article 2 Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 4
Author
All
Sauerland, Volkmar 4 Glazik, Christian 2 Ouali, Mourad el 2 Srivastav, Anand 2 Ouali, Mourad El 1 el Ouali, Mourad 1
Published in...
All
Games 4
Source
All
ECONIS (ZBW) 2 EconStor 2
Showing 1 - 4 of 4
Cover Image
The exact query complexity of yes-no permutation mastermind
Ouali, Mourad el; Sauerland, Volkmar - In: Games 11 (2020) 2/19, pp. 1-11
Mastermind is famous two-player game. The first player (codemaker) chooses a secret code which the second player …. We consider a variant, called Yes-No AB-Mastermind, where both secret code and queries must be repetition-free and the … provided information by the codemaker only indicates if a query contains any correct position at all. For this Mastermind …
Persistent link: https://www.econbiz.de/10012431870
Saved in:
Cover Image
The exact query complexity of yes-no permutation mastermind
el Ouali, Mourad; Sauerland, Volkmar - In: Games 11 (2020) 2, pp. 1-11
Mastermind is famous two-player game. The first player (codemaker) chooses a secret code which the second player …. We consider a variant, called Yes-No AB-Mastermind, where both secret code and queries must be repetition-free and the … provided information by the codemaker only indicates if a query contains any correct position at all. For this Mastermind …
Persistent link: https://www.econbiz.de/10013200018
Saved in:
Cover Image
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad El; Glazik, Christian; Sauerland, Volkmar; … - In: Games 9 (2018) 1, pp. 1-12
Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its …-Peg variant of Mastermind, where the only information concerning a guess is the number of positions in which the guess coincides …
Persistent link: https://www.econbiz.de/10011852720
Saved in:
Cover Image
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el; Glazik, Christian; Sauerland, Volkmar; … - In: Games 9 (2018) 1/2, pp. 1-12
Mastermind is a two players zero sum game of imperfect information. Starting with Erdos and Rényi (1963), its …-Peg variant of Mastermind, where the only information concerning a guess is the number of positions in which the guess coincides …
Persistent link: https://www.econbiz.de/10011771356
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...