Table of Contents
Project Euler Problem 312 deals with finding all cyclic paths (Hamiltonian circuits) through a “Sierpinski Graph”.
In trying to understand how these could be constructed, I wrote some code to generate images of random paths. I can't provide any details on the implementation as that would spoil part of the solution.
Lines
n = 4
n = 5
n = 6
n = 7
Filled
n = 4
n = 5
n = 6
n = 7
