Spring 2018 Monte Carlo project at ENSAE: simulation of self-avoiding random walks
2D and 3D wormlike chain generator for Python and written in C++
Simulating self-avoiding random walks on lattices and experimenting with grid graphs, Hamiltonian paths, etc.
Simulation of simple and self-avoiding random walks in python.
Enumerate all (self avoiding) walks up to a certain length on a square lattice in C++ at compile time
Created this to do different things with my self-avoiding walk.
Self-avoiding walk algorithm to be used in a game
Qualitative and statistically grounded comparison of growth sampling and Metropolis Monte Carlo methods for three-dimensional self-avoiding polymer chains on a cubic lattice.
Add a description, image, and links to the self-avoiding-random-walk topic page so that developers can more easily learn about it.
To associate your repository with the self-avoiding-random-walk topic, visit your repo's landing page and select "manage topics."