Laird Breyer's java applets Metropolis-Hastings algorithms are a class of Markov chains which are commonly used to perform large scale calculations and simulations in Physics and Statistics. The button below opens a separate window from your browser containing a demonstation of some of the most common chains which are used for this purpose. The window is resizable, and you may need to adjust its dimensions depending on your system configuration. Forest fire Forest fire You are encouraged to solve this task according to the task description, using any language you may know. Implement the Drossel and Schwabl definition of the forest-fire model. It is basically a 2D cellular automaton where each cell can be in three distinct states (empty, tree and burning) and evolves according to the following rules (as given by Wikipedia) A burning cell turns into an empty cell A tree will burn if at least one neighbor is burning A tree ignites with probability f even if no neighbor is burning An empty space fills with a tree with probability p
Think Labyrinth: Maze Algorithms Maze Classification Mazes in general (and hence algorithms to create Mazes) can be organized along seven different classifications. These are: Dimension, Hyperdimension, Topology, Tessellation, Routing, Texture, and Focus. A Maze can take one item from each of the classes in any combination. The R Project for Statistical Computing