  We discuss ``puzzles of prisoners and hats`` with infinitely many prisoners
and more than two hat colors. Assuming that the set of hat colors is equipped
with a commutative group structure, we prove strategic equivalence among
puzzles of several protocols with countably many prisoners.
