For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat

Abstract

Several sages wearing colored hats occupy the vertices of a graph. Each sage tries to guess the color of his own hat merely on the basis of observing the hats of his neighbors without exchanging any information. Each hat can have one of three colors. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We completely solve the problem of describing all graphs for which the sages win.