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.
Cite
@article{arxiv.2104.04624,
title = {Playing cards with Vizing's demon},
author = {Brian Rabern and Landon Rabern},
journal= {arXiv preprint arXiv:2104.04624},
year = {2021}
}