abstract = "...require specialized algorithmic adaptations but
enable the evolution of exceptionally large, spatially
structured populations. We describe the design and
deployment of an evolutionary algorithm on the S1,
starting with a spatially distributed genetic algorithm
applied to the MaxOnes problem, and extending to two
more sophisticated genetic programming representations:
Linear Genetic Programming(LGP) and Cartesian Genetic
Programming(CGP). Each approach is carefully adapted to
exploit the S1 architectural strengths, including
synchronous population updates and local neighborhood
selection through hardware-supported communication.
Additionally, we present a modular software library
that abstracts away the S1 low-level features,
simplifying the development of evolutionary algorithms
on this platform. Our results confirm the S1 capability
to efficiently evolve large populations, highlighting
its potential for advancing research in large-scale,
spatially structured genetic programming.",