https://github.com/innovativeinventor/golhs

Arbitrary cellular automata, in Haskell. Featuring the Game of Life and some cool recursion
https://github.com/innovativeinventor/golhs

haskell

Last synced: 15 days ago
JSON representation

Arbitrary cellular automata, in Haskell. Featuring the Game of Life and some cool recursion

• Host: GitHub
• URL: https://github.com/innovativeinventor/golhs
• Owner: InnovativeInventor
• License: mit
• Created: 2020-09-15T05:40:55.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2020-09-15T05:43:39.000Z (almost 6 years ago)
• Last Synced: 2025-02-26T14:45:22.337Z (over 1 year ago)
• Topics: haskell
• Language: Haskell
• Homepage:
• Size: 7.81 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: ChangeLog.md
  • License: LICENSE

Awesome Lists containing this project

README

          
## golhs

A primitive, monadic, recursive implementation of cellular automata, in Haskell. Currently only a 9x9 grid is implemented.