Satisfied: —
Avg similar neighbors: —
Moves this run: 0
Iteration: 0
This simulation implements Schelling's basic idea: two types of agents occupy cells on a grid with some empty cells. Each agent checks its neighbors; if fewer than the chosen fraction are the same type (tolerance), the agent is dissatisfied and moves. Try changing tolerance, vacancy, radius, and update rule.
Notes: This is an implementation of the classic Schelling model (see Schelling, 1969). The "tolerance" is the minimum percent of neighbors of the same type required for an agent to be satisfied. Higher tolerance tends to produce larger clusters.