Also among the interests of the past couple of days: the Breadth-first Search and the Depth-first Search:
Both are algorithms for searching tree or graph data structures (think: mazes). The Breadth-first Search starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a search-key) and explores the neighbor nodes first, before moving to the next level neighbors. The Depth-first Search starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.
Simon tried writing a Breadth-first Search code, but got stuck:
Among other interests were the Bézier curve, used in computer graphics:
Simon has also followed quite a few tutorials on particle systems, diffusion aggregation and tried building a spring animation in p5.js from this guest tutorial on the Coding Train channel. Here is Simon’s spring animation code (unfinished):
Physics engines continue to fascinate him. He says that the Codea app (on his iPad) is also a physics engine. He built the following animation in Codea in the language called Lua: