Mourad El Ouali

most citedOn the Query Complexity of Black-Peg AB-Mastermind

2 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2024

Asymptotically Optimal Threshold Bias for the $(a : b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games

Adnane Fouadi, Mourad El Ouali, Anand Srivastav

We study the $(a : b)$ Maker-Breaker subgraph game played on the edges of the complete graph $K_{n}$ on $n$ vertices, $n, a, b \in N$ where the goal of Maker is to build a copy…

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…

Asymptotically Optimal Threshold Bias for the (a:b) Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games

On the Query Complexity of Black-Peg AB-Mastermind

Asymptotically Optimal Threshold Bias for the $(a : b)$ Maker-Breaker Minimum Degree, Connectivity and Hamiltonicity Games