Demonstration of the reductions described in
"The Planar Hamiltonian Circuit Problem is NP-Complete" by M. R. Garey, D. S. Johnson, and R. Endre Tarjan, https://doi.org/10.1137/0205049
and
"UNO is hard, even for a single player" by Eric D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, and Yoshi Uno, http://erikdemaine.org/papers/Uno_TCS/