-
This is an idea I had from the very beginning, but requires a lot of time investment for questionable reward.
svg2gcode draws paths one by one with a naive DFS traversal of the SVG. There is a bett…
-
Here we collect a series of algorithms that have been repurposed for generative art
-
- http://sunnybala.com/2018/09/10/python-etch-a-sketch.html
- https://create.arduino.cc/projecthub/iot_lover/arduino-drawing-via-web-using-step-motor-controller-cb5f33
- https://mathematica.stack…
-
I suggest doing a coding challenge on generating permutations of an array. That can easily be done beautifully and the intuition of the algorithms is usually pretty straightforward. Namely, I'd love t…
-
```
While attempting to solve the TSP for multiple sets of points (by looping over
all the sets and calling the the constraint solver on each set), an error is
thrown: gflags.DuplicateFlagError: The…
-
**Description:**
This algorithm leverages movement ratings from previous iterations with an ordered list of movements. The list should include both inter- and intra-route movements. In the case of in…
-
@norvig and @MrDupin: In `search.ipynb`, visualizations of some of the searching techniques are not yet implemented. We can surely implement visualizations for them in the notebook.
For example, w…
-
Hello,
I am attempting to use the Pointerformer model on the Traveling Salesman Problem (TSP) with 1000 nodes on an RTX 2070 GPU with 8GB of memory. However, I am encountering out-of-memory issues …
-
_From @Weibye on August 23, 2017 7:6_
Curves should be flipped to always have start of curve closer to last movement than end of curve. This will further reduce unnecessary criss-crossing and improve…
-