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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, April 05, 2012, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Henning Thomas

Mastermind

Most of you probably know the game of Mastermind. In this game, one player (the "codemaker") makes a secret code word m=(m_1, m_2, ..., m_n) over an alphabet of size k. where in the classical board game (n=4, k=6) the symbols are represented by pegs of different colors. The other player (the "codebreaker") has to identify the code word by asking questions of the form q=(q_1, q_2, ..., q_n) over the same alphabet. The codemaker answers a question with a distance measure to the secret code by revealing (i) the number a(m,q) of positions i for which m_i = q_i, in the original board game depicted by black pegs, and (ii) the maximum a(m,q) over all permutations of q, originally depicted by white pegs.
In this talk we present some known upper and lower bounds as well as a new strategy for the case when k=n which improves the currently best-known upper bounds.

This is joint work with Benjamin Doerr, Reto Spöhel and Carola Winzen from MPI Saarbrücken.


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

Previous talks by year:   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