Finding a confirmed civilian among $n^2$ players in Mafia

For discussing Olympiad Level Combinatorics problems
rah4927
Posts: 108
Joined: Sat Feb 07, 2015 9:47 pm

Finding a confirmed civilian among $n^2$ players in Mafia

Unread post by rah4927 » Sun Apr 02, 2017 1:58 pm

$n^2$ players labelled $1,2,...,n^2$ were playing in a mafia game. There were $2n-3$ mafia in total. During the night phase, everyone asked the moderator a question about the status of some player (mafia or civilian) so that they can reveal this information in the day phase. During the day phase, player $i$ revealed information about player $i+1$ (where $n^2+1=1$) whether he is mafia or not. Note that civilians always speak the truth, but the mafia can either lie or speak the truth.

At this stage, can the civilians successfully identify a confirmed civilian amongst the $n^2$ players ?

Post Reply