The Hats game. The power of constructors [article]

Aleksei Latyshev, Konstantin Kokhas
<span title="2021-02-14">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We analyze the following general version of the deterministic Hats game. Several sages wearing colored hats occupy the vertices of a graph. Each sage can have a hat of one of k colors. 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. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. We present an example of a planar
more &raquo; ... h for which the sages win for k = 14. We also give an easy proof of the theorem about the Hats game on "windmill" graphs.
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.07138v1">arXiv:2102.07138v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dyxf2f5hhjctbnrb6fnjzrdvby">fatcat:dyxf2f5hhjctbnrb6fnjzrdvby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210218195935/https://arxiv.org/pdf/2102.07138v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/d4/d4d4945bb1cec5d1188124bb213d9b428d94194d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.07138v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>