Generating Hamiltonian Cycles in Rectangular Grid Graphs
Continuing the theme of looking at the process of developing a generator, here’s a post by Pascal Sommer about generating a particular kind of shape. In this case, a Hamiltonian cycle: a loop through a graph that visits each node only once.
I found this process is illustrative: flipping the problem from finding a minimum spanning tree to calculating the Hamiltonian cycle mirrors a common action I find when I’m working on a generator. Often, inverting the problem will reveal new opportunities.