Updated: Oct 31, 2019
This small project is more algorithm-based than art-based. It aims to design a self-avoiding path.
The idea is to check the points adjacent to the current points. For each points, it will store a boolean value of whether it has been discovered or not. If it has, then avoid these points and try other points. Otherwise, choose this point and continue the same process. If all the adjacent points has been discovered, renew the process. It is not a hard algorithm, but it visualize the foundation of many algorithm in Graph theory.