# Simulating worm feeding patterns with computational models

## TL;DR

This paper uses computer simulations to study how simple movement choices by worms can create complex feeding paths.

## Contribution

The study introduces a novel grid-based simulation with diagonal movement options to generate and analyze worm paths.

## Key findings

- The simulation reveals symmetrical, looping, and chaotic worm paths.
- Some paths oscillate between chaotic and ordered movement over millions of steps.
- Local movement decisions are shown to significantly influence global search strategies in worms.

## Abstract

Worms create complex paths when moving through sediment to feed. This research applies computer simulation models to provide a unique approach to visualise and quantify the process by which complex worm paths can emerge from simple local movement decisions. A grid environment is proposed in which worms can move with choice of up to 8 directions at each step. This uses a square grid with diagonal paths which has not been investigated before and the resulting number of complex paths is increased compared to triangular grids. Results identify many novel worm paths. Some of the resulting paths are symmetrical, others produce repetitive looping paths, others return to the origin. Interesting worm paths are identified with chaotic movement. Some include oscillating between chaotic and ordered movement for which the outcome is still unknown after millions of steps. A conclusion that may be extrapolated to other creatures is that local movement decisions of a species substantially determine the overall global search strategy that emerges.