y-taka-23 / elm-forestfire

A forest-fire model as a probabilistic cellular automaton.

Forest-Fire Model in Elm (Try It)

A forest-fire model as a probabilistic cellular automaton.

Transition Rules

1. A burning tree becomes a empty site
2. A green tree becomes a burning tree if at least one of its nearest neighbors is burning.
3. At an empty site a tree grows with probability p.
4. A tree without a burning nearest neighbor becomes a burning tree with probability f.

Run Things Locally

git clone https://github.com/y-taka-23/elm-forestfire.git
cd elm-forestfire
npm install
elm-package install
npm run start

References

• Bak, P., Chen, K. and Tang, C. (1990), "A forest-fire model and some thoughts on turbulence." Phys. Lett. A 147, pp.297–300.
• Drossel, B. and Schwabl, F. (1992), "Self-organized critical forest-fire model." Phys. Rev. Lett. 69, pp.1629–1632.