Markov Chains

Implements a simple Markov chain cellular automaton: a 200×200 grid where each cell probabilistically changes between four states based on a constant transition probability, with optional neighbourhood-based interactions. Serves as an educational example of implementing stochastic state-based models in SELES.