In traditional gain graph colorings, the coloring set is G x [k] or G x [k] union {0}. To generalize this we will use arbitrary sets Q, where G acts on Q. Rather than counting proper colorings, we will count fully frustrated states. I will conclude with some examples and a deletion contraction formula for Stanley's Chromatic Symmetric Function. This talk is based on two articles of Thomas Zaslavsky.