



















We analyze the version of the deterministic Hats game. In this paper, we present new constructors, i.e. theorems that allow built winning strategies for the sages on different graphs. Using this technique we calculate the hat guessing number ${\text{HG}}_s(G)$ for paths and "petunias", and present a planar graph $G$ for which ${\text{HG}}_1(G) \ge 22$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。