Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 07, 2021, 12:15 pm
Duration: 30 minutes
Location: CAB G51 and Zoom: conference room
Speaker: Maxime Larcher
Mastermind is a classical example of information game, and many variants exist. We focus on Static Permutation Mastermind: there are n pegs and n colours, the codeword and queries may not contain two pegs of the same colour, and all queries need be chosen in advance.
Answering a question of Glazik, Jäger, Schiemann and Srivastav, we show that there exists a set of O(n log n) queries from which all codewords can be recovered. This matches the lower bound. Our approach improves on Chvátal's solution for 'classical' Mastermind as it allows for efficiently reconstructing the codeword.
Automatic MiSe System Software Version 1.4803M | admin login