I'm not sure. I'm always messing around with different projects.

I used blocklike.js to jump from Scratch to JavaScript. Then I worked for months on this one game for the app store called Sticky Quest. You can find it here: https://itunes.apple.com/us/app/sticky-quest/id1425679649?mt... This how I learned how to use npm packages such as Cordova and Eslint.

I'm 28 and have been using Javascript for years and still have no idea how to use Eslint in a terminal.

How did you like Scratch, and how was it going from Scratch to JavaScript?

There's another visual programming language called "Snap!", which is inspired by and similar to Scratch, but has the full power of JavaScript and Scheme, everything's an object, and you can define your own blocks. Plus there are some amazing networking, speech and AI blocks, too! (It has a JavaScript block that makes it very easy to extend and plug in existing JavaScript code.)

I'm interested to know what you think of Snap!, from your perspective of going from Scratch to JavaScript!

https://snap.berkeley.edu

AI extensions of Snap! for the eCraft2Learn project:

https://ecraft2learn.github.io/ai/

>The eCraft2Learn project is developing a set of extensions to the Snap! programming language to enable children (and non-expert programmers) to build AI programs. You can use all the AI blocks after importing this file into Snap! or Snap4Arduino. Or you can see examples of using these blocks inside this Snap! project.

Here's more info:

https://news.ycombinator.com/item?id=17594403

You could try expanding this project beyond elementary CAs.

One option is a 'totalistic' CA which looks at the average value of a given neighborhood, and can have more than two states.

http://mathworld.wolfram.com/TotalisticCellularAutomaton.htm...

Or you could generate CAs with different starting conditions. Some beautiful elementary CAs don't 'show up' with just one initial point.

The Moveable Feast Machine is similar to cellular automata, but different in some important ways, that make it extremely robust and fault tolerant:

It's a "Robust First" asynchronous distributed fault tolerant cellular-automata-like computer architecture.

Robust programs running on massively parallel unreliable hardware can actually tolerate hardware failure and repair themselves. The Demon Hoard Sort algorithm is an inherently robust sorting algorithm for the Moveable Feast Machine.

http://movablefeastmachine.org/

The "Distributed City Generation" video demonstrates a Movable Feast Machine rule that builds a self-healing city that fills all available space with urban sprawl, with cars that drive between buildings, and city streets that adaptively learn how to route the cars to their nearest destinations, and the city even repairs itself after disasters!

https://www.youtube.com/watch?v=XkSXERxucPc

Here's some more info:

https://news.ycombinator.com/item?id=14236973