Abstract: A number of ``hat games'' have appeared in the math puzzle literature over the last 15 years, many motivated by questions in computational complexity. It is well known that some of these come down to questions in error-correcting codes. Our goal is to explore this connection, focusing on two examples in which covering codes, and ``octopus covering codes'' occur.