{"id":20886467,"url":"https://github.com/gsurma/game_of_life","last_synced_at":"2026-04-01T20:29:24.878Z","repository":{"id":90787560,"uuid":"189836358","full_name":"gsurma/game_of_life","owner":"gsurma","description":"NetLogo implementation of Conway's Game Of Life.","archived":false,"fork":false,"pushed_at":"2021-07-09T08:58:56.000Z","size":98,"stargazers_count":6,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-26T21:59:45.255Z","etag":null,"topics":["conway-game","conways-game-of-life","game-of-life","life","netlogo","netlogo-example"],"latest_commit_sha":null,"homepage":"https://gsurma.github.io","language":"NetLogo","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/gsurma.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null},"funding":{"patreon":"gsurma"}},"created_at":"2019-06-02T11:07:51.000Z","updated_at":"2023-09-12T21:06:47.000Z","dependencies_parsed_at":null,"dependency_job_id":"4868eed8-2ec7-4f0b-8313-66e8eb6c9c5a","html_url":"https://github.com/gsurma/game_of_life","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/gsurma/game_of_life","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gsurma%2Fgame_of_life","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gsurma%2Fgame_of_life/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gsurma%2Fgame_of_life/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gsurma%2Fgame_of_life/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/gsurma","download_url":"https://codeload.github.com/gsurma/game_of_life/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/gsurma%2Fgame_of_life/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31291638,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-01T13:12:26.723Z","status":"ssl_error","status_checked_at":"2026-04-01T13:12:25.102Z","response_time":53,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["conway-game","conways-game-of-life","game-of-life","life","netlogo","netlogo-example"],"created_at":"2024-11-18T08:17:04.502Z","updated_at":"2026-04-01T20:29:24.856Z","avatar_url":"https://github.com/gsurma.png","language":"NetLogo","funding_links":["https://patreon.com/gsurma"],"categories":[],"sub_categories":[],"readme":"\u003ch3 align=\"center\"\u003e\n  \u003cimg src=\"assets/game_of_life_icon_web.png\" width=\"300\"\u003e\n\u003c/h3\u003e\n\n# Game of Life\n\nNetLogo implemetation of [John Horton Conway](https://en.wikipedia.org/wiki/John_Horton_Conway)'s [Game Of Life](https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life).\n\n## Rules\n\nThe universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, alive or dead, (or populated and unpopulated, respectively). Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:\n\n\tAny live cell with fewer than two live neighbours dies, as if by underpopulation.\n\tAny live cell with two or three live neighbours lives on to the next generation.\n\tAny live cell with more than three live neighbours dies, as if by overpopulation.\n\tAny dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.\n\t\n## Examples\n\n\u003cimg src=\"assets/example1.png\" width=\"400\"\u003e\n\u003cimg src=\"assets/example2.png\" width=\"400\"\u003e\n\u003cimg src=\"assets/example3.png\" width=\"400\"\u003e\n\n## Author\n\n**Greg (Grzegorz) Surma**\n\n[**PORTFOLIO**](https://gsurma.github.io)\n\n[**GITHUB**](https://github.com/gsurma)\n\n[**BLOG**](https://medium.com/@gsurma)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgsurma%2Fgame_of_life","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgsurma%2Fgame_of_life","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgsurma%2Fgame_of_life/lists"}