Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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

Solving Static Permutation Mastermind using O(n log n) Queries

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login