2 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2020
The Exact Query Complexity of Yes-No Permutation Mastermind
Moura El Ouali, Volkmar Sauerland
Mastermind is famous two-players game. The first player (codemaker) chooses a secret code which the second player (codebreaker) is supposed to crack within a minimum number of code…
cs.DS2016★ 2 cited
On the Query Complexity of Black-Peg AB-Mastermind
Mourad El Ouali, Christian Glazik, Volkmar Sauerland +1
Mastermind game is a two players zero sum game of imperfect information. The first player, called codemaker, chooses a secret code and the second player, called codebreaker, tries…
cs.DS2013★ 2 cited
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation
Mourad El Ouali, Volkmar Sauerland
In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The…