{"id":21160480,"url":"https://github.com/shredengineer/hexacon","last_synced_at":"2026-04-27T17:04:42.174Z","repository":{"id":222534124,"uuid":"332721070","full_name":"shredEngineer/hexacon","owner":"shredEngineer","description":"Conway's Game of Life on a Hexagonal Grid","archived":false,"fork":false,"pushed_at":"2021-01-25T11:29:30.000Z","size":243,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2026-01-01T17:57:35.253Z","etag":null,"topics":["conways-game-of-life","grid","hexagonal","html","javascript","jquery"],"latest_commit_sha":null,"homepage":"","language":"HTML","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/shredEngineer.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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}},"created_at":"2021-01-25T11:13:50.000Z","updated_at":"2021-11-16T01:52:59.000Z","dependencies_parsed_at":"2024-02-14T20:17:06.326Z","dependency_job_id":"0fd88033-d605-47ec-9ccc-91cf649c326b","html_url":"https://github.com/shredEngineer/hexacon","commit_stats":null,"previous_names":["shredengineer/hexacon"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/shredEngineer/hexacon","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shredEngineer%2Fhexacon","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shredEngineer%2Fhexacon/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shredEngineer%2Fhexacon/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shredEngineer%2Fhexacon/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shredEngineer","download_url":"https://codeload.github.com/shredEngineer/hexacon/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shredEngineer%2Fhexacon/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32345872,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-26T23:26:28.701Z","status":"online","status_checked_at":"2026-04-27T02:00:06.769Z","response_time":128,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["conways-game-of-life","grid","hexagonal","html","javascript","jquery"],"created_at":"2024-11-20T13:04:05.600Z","updated_at":"2026-04-27T17:04:42.157Z","avatar_url":"https://github.com/shredEngineer.png","language":"HTML","funding_links":[],"categories":[],"sub_categories":[],"readme":"# hexacon\nConway's Game of Life on a Hexagonal Grid (implemented in JavaScript)\n\nPlay around with it here: **https://paulwilhelm.de/hexacon.html** [*Epilepsy Warning*]\n\n\nDiscussion Thread: https://www.reddit.com/r/holofractal/comments/l4lmrl/enjoy_this_trippy_hexagonal_version_of_conways/\n\n    I assume most of you know Conway's Game of Life -- a simple set of rules\n    over a square digital grid that shows intriguing evolution and self-organization.\n    Each cell's lifecycle is determined by its four or eight neighbours -- depending on the implementation.\n\n    Now I figured that a hexagonal grid would be the most natural way to implement this.\n    Why? Because in hexagonal coordinates, there is no ambiguity between the number of\n    possible neighbors -- each cell is perfectly surrounded by exactly six neighbors.\n\n    The results are quite trippy. :)\n\n\n![Screenshot](https://raw.githubusercontent.com/shredEngineer/hexacon/main/Screenshot.png \"Screenshot\")\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshredengineer%2Fhexacon","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshredengineer%2Fhexacon","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshredengineer%2Fhexacon/lists"}