7.3: The Game of Life – The Nature of Code

This video covers the Game of Life 2D cellular automaton in Processing (Java).

Read along:

Original 1970 Scientific American Article:


Steve Klise’s GOL processing.js implementation:

Exploring Emergence:

Help us caption & translate this video!

📄 Code of Conduct:

Nguồn: https://svdpch.org/

Xem thêm bài viết khác: https://svdpch.org/game/

27 thoughts on “7.3: The Game of Life – The Nature of Code”

  1. These videos are so much fun to watch, I could watch for hours and not realise the time has passed. Maybe it's about time I actually do some coding of my own lol

  2. Need some answers here, hope you can help here:
    1. Would an OOP approach consume more memory?
    2. Would an OOP approach be able to simulate an infinite grid?
    3. Can you please explain hashlife?

  3. Had to go make my own version. https://www.youtube.com/watch?v=gzvom9UCY0U
    As someone with no background in mathematics or programming, it was quite easy to achieve thanks to the simplicity of the rules behind the game. The complexity that 'evolves' from that simplicity is truly captivating though.

  4. Why are you not more famous!!!! I know this is an old video but I am dying to see if anything came out of the discussion about fractals being repetitive or complex systems. You are amazing. Thank you

  5. There was a new version, called smoother life, then updated again to gaussian life. I've unfortunately not found much explaination in these two versions however. Would be cool to see you try to replicate them.

  6. Thanks for video , i did this example in JS https://jsfiddle.net/Erwin/afeaaysn/ if you have some kind of tips to make it better pls answer this comment :). I have idea how to go deeper in this project and if you want i will share it with you , thanks for inspiration!

  7. One company I know includes this as their interview requirement and you must be able to reproduce this in order to gain employment with them, so it is worth understanding.

  8. you can calculate the edges the same way
    and it actually works the same.

    doesn't really change a thing
    it just made it that overpopulation on edges is quite hard to achive.

  9. i tried again doing XOR on 2d automaton

    this is basicly how each one calculated

    bool cs = States[x, y];
    for (int i = y – 1; i <= y + 1; i++)
    for (int k = x – 1; k <= x + 1; k++)
    if (i < 0 || k < 0 || i > 37 || k > 51)
    if (k == x || i == y)
    if (States[k, i])
    cs = !cs;

    this is the result:

  10. This is such a great concept! And you're awesome!! 😀 I've been following these by writing the exercises with p5 and this Game of Life thing is the first one that seems to get hindered a lot by this high level language 😮 Not sure if it's the p5 library or the javascript language itself but things are slowing down with all the nested for loops n stuff. Even a with a grid size of 400 by 200 this is getting quite slow 🙁 I got carried away by all these awesome videos on youtube of cool Game of Life creatures doing such complex stuff on big matrixes, but I'd have to go down in language level to try it myself 🙁 But maybe I have to after this series cus this is insanely cool! 😀 Thanks again for awesome teaching! 😀


Leave a Comment