Simon translated Daniel Shiffman’s Diffusion-limited Aggregation Coding Challenge into Codea. The coding challenge explores the generative algorithm “Diffusion-Limited Aggregation”, whose visual pattern is generated from random walkers clustering around a seed (or set of seed) point(s).
Unfortunately, every time the iPad falls asleep the application seems to stop, so we never got a sizable tree.
In today’s project (partly based upon Daniel Shiffman’s Diffusion-Limited Aggregation Coding Challenge), Simon attempted to combine the generative algorithm “Diffusion-Limited Aggregation” (DLA) and an IQ Puzzler game. As DLA visual pattern is generated from random walkers clustering around a seed (or set of seed) point(s).
The project is not finished yet, the code is being updated at:
Simon started with a classical random walker sketch in p5.js:
Ans then explained to me how he wants to turn that into a Puzzler game:
Here he wrote his own code to create a DLA visual pattern:
And a counter to show the decreasing frame rate:
This is what an IQ Puzzler game looks like: