We introduce a simple game made up of a board of coins on a triangular lattice. We then study the possibility of turning the board from one pattern of heads and tails to some other pattern. Given that a solution exists we find a precise answer to the number of solutions possible. We then generalize this to more complex boards with coins of many sides (sic) or colors.