For Which Graphs the Sages Can Guess Correctly the Color of at Least One Hat
- 11 Downloads
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.
Unable to display preview. Download preview PDF.
- 2.T. Ebert, “Applications of recursive operators to randomness and complexity,” PhD Thesis, University of California, Santa Barbara (1998).Google Scholar
- 3.M. Gardner, The Scientific American Book of Mathematical Puzzles & Diversions, Simon and Schuster (1959).Google Scholar
- 5.W. W. Szczechla, “The three-colour hat guessing game on the cycle graphs,” Electron. J. Combin., 24, No. 1, Paper #P1.37 (2017).Google Scholar