Deduce the Boss's Birthday

This puzzle is a classic mutual-knowledge birthday riddle involving a small list of candidate dates and two people, each told only part of the information. One person knows the month, the other knows the day, and they make public statements about what they do and do not know. Each statement rules out some of the candidate dates in a way that is visible to both of them and to the solver. The challenge is to track how their knowledge evolves after each remark and to determine which single date is consistent with all of their claims.

It leans heavily on logical deduction, reasoning about what others know, and the idea of common knowledge. To solve it cleanly, a candidate must work systematically with sets of possible dates and eliminate them step by step using the implications of each statement. Interviewers watch for comfort with rigorous logical reasoning, careful interpretation of indirect information, and the ability to keep multiple hypothetical possibilities in mind without getting lost or making hidden assumptions.

What it tests

This class of problems is governed by the logic of mutual knowledge and elimination based on shared information. Each participant's statement encodes not only what they know, but what they know about the other's knowledge, creating a chain of logical deductions. The core structure is that each piece of information—month or day—partitions the set of possible dates, and each statement further restricts this set by ruling out possibilities that would violate the knowledge state described. The process is recursive: each person's knowledge is updated not just by their own information, but by the implications of what the other person could or could not know, given the public statements. This iterative elimination continues until only one possibility remains, which satisfies all the constraints imposed by the sequence of statements.