2018/01/03 by Glivický, Petr
#00A08 #Combinatorics (math.CO) #FOS: Mathematics #Primary 91A05 #Secondary 91A43
paper · doi:10.48550/arxiv.1801.01184
We study the famous mathematical puzzle of prisoners and hats. We introduce a framework in which various variants of the problem can be formalized. We examine three particular versions of the problem (each one in fact a class of problems) and completely characterize them as to (non)existence of winning strategies.