  We analyze a solitaire game in which a demon rearranges some cards after each
move. The graph edge coloring theorems of K\H{o}nig (1931) and Vizing (1964)
follow from the winning strategies developed.
