#162 — Self Avoiding Walk
It's finally time to attempt a Self-Avoiding Walk! In this video, I quickly visualize a simple JavaScript p5.js implementation of a self-avoiding walk. I then tackle the more complex problem of backtracking to find a solution to a space-filling self-avoiding walk.
Discussion of the math and physics of self-avoiding walks.
Discussion of counting self-avoiding walks.
Discussion of pivot algorithm.
A random walker is implemented in p5.js
The classic game of minesweeper is implemented in p5.js.
This video covers the JavaScript Array higher order function filter().
A maze generator is implemented in p5.js
The concept of recursion is used to create fractal patterns in p5.js.
An implementation of the A* pathfinding algorithm to find the optimal path between two points in a 2D grid
Livestream of a 3D self avoiding walk.
- Editing
by Mathieu Blanchette
- Animations
by Jason Heglund