MATLAB Implementation of Cellular Automata: Forest Fire Model

Cellular Automata Forest Fire Model with implementation rules: (1) Burning trees become empty cells; (2) Green trees with burning neighbors become burning trees; (3) Empty cells grow trees with probability p; (4) Trees ignite with probability f (lightning) when no neighbors are burning. Code implementation demonstrates state transitions using neighborhood checks and probabilistic rules.