Fluoddity CA

A physarum-like particle system rebuilt as a cellular automaton: mass and velocity per cell, no particles.

Open the simulator → source

Fluoddity primer

Fluoddity, by aphid91, generalises Sage Jenson's physarum model. Particles never sense each other. They only read a trail that everyone writes, and that trail holds velocity, not density, so opposite flows cancel. How a particle reacts to what it reads is decided by a small Fourier "brain" with 80 parameters, shared by its cohort.

The model as pseudocode

Grid:      float[H, W, 2]     # trail: net flow (x, y) per pixel, faded and blurred

Particle:
    pos: vec2                 # state
    vel: vec2                 # state; its direction is the heading
    brain: Brain              # shared by its cohort: 4 numbers in, 4 out

Globals: drag, strafe_power, sensor_angle, sensor_dist, sensor_gain, persistence, diffusion

step():
    for p in particles:
        fwd = normalize(p.vel)
        L = local(sample(grid, p.pos + rot(+angle)·fwd·dist), fwd)   # (along, across)
        R = local(sample(grid, p.pos + rot(-angle)·fwd·dist), fwd)
        out = brain(L, R) + mirror(brain(mirror(R), mirror(L)))     # no left/right bias
        force, strafe = to_world(out[0:2]), to_world(out[2:4])
        p.vel = p.vel * drag + force
        p.pos = p.pos + p.vel + strafe * strafe_power               # strafe: a hop, never stored

    grid = blur(grid) * persistence
    for p in particles:
        grid[p.pos] += p.vel * (1 - persistence)                    # a sharp 1-4 pixel splat

• brain(x): a sum of 10 terms, Σ ampᵢ · [sin φ, cos φ, sin 2φ, cos 2φ] with φ = freqᵢ·x + offsetᵢ.
• mirror(v): (v.along, −v.across). Running the brain again in the mirrored world and adding the result means particles turn left as readily as right.
• Strafe moves a particle sideways without changing its velocity, so it can swim upstream while its trail points the way it faces.
• Colour: hue = 0.5 × the forward part of the force.

Fluoddity as a CA

Each step of the conversion kept Fluoddity's constants, so the two run the same presets.

1. Grids.
   • One shared trail float[H,W,2], as in Fluoddity.
   • Per cohort, a velocity float[H,W,2] (the "particle" of that cohort living in each cell) and a mass float[H,W,1], counted in particles.
   Each cohort is its own channel of the CA. Cohorts never see each other directly; they interact only through the trail, which every cohort writes its momentum into and reads with its eyes.
2. Brain. Fluoddity's, unchanged, with the mirror trick. There is one per cohort, its own mutated row of the rule table.
3. Perception. Two eye kernels at Fluoddity's defaults: 2.56 × sensor_distance cells out, at ±sensor_angle·π from the cell's velocity. Each is one bilinear tap, which is close to a σ ≈ 0.4 Gaussian. Projected onto the velocity and its perpendicular, they give the brain's four inputs.

   

4. Force. Not scaled by mass, as in Fluoddity. An empty cell computes a force but carries nothing, so it behaves like an empty pixel.
5. Velocity. vel = vel·drag + force.
6. Move. Each cell sends its mass, momentum and colour to cell + vel + strafe·strafe_power, split by overlap over the cells there. The new velocity is momentum ÷ mass. This is advection by reintegration tracking, and it conserves mass exactly.
7. Deposit. trail += mass · vel · (1 − persistence) · 7.07, where 7.07 is Fluoddity's average splat per particle.

What Fluoddity doesn't have

Spread: the box that carries the mass can be wider than one cell. Wider means softer and more liquid.

Pressure: mass above a rest level pushes down its own gradient. At 0 it is exactly the original model.

Species: a cohort can be its own field, with its own mass, velocity and brain. Species never see each other directly. They meet in the shared trail, which all of them write to and read from, and, with pressure on, in the crowding.

A family of its own

A novelty search started from Fluoddity's presets with random spread, pressure and brain choice, and mutated them slowly. It scored candidates on 13 measured features and threw out dead, static and exploding runs. 24 of its 194 candidates are the CA family in the simulator.

Growing a gecko

The CA's step written in PyTorch is differentiable, so it can be trained by gradient descent: a disc of mass on a 256² grid is fitted to grow the gecko at its native 128 px. The faithful 80-number brain reaches the silhouette. Letting the eyes see mass holds the shape longer, and six hidden channels give the cleanest fit.

Neither part draws the gecko alone. The brain with a symmetric launch grows a star, and the learned launch without the brain smears into a blob. The rule is symmetric, so the launch velocity is the hint that gives the animal a front.