https://github.com/juliencrn/game-of-life

A game-of-life implementation with Rust and WebAssembly.
https://github.com/juliencrn/game-of-life

canvas js rust tailwindcss vanilla-javascript wasm webassembly

Last synced: 18 days ago
JSON representation

A game-of-life implementation with Rust and WebAssembly.

• Host: GitHub
• URL: https://github.com/juliencrn/game-of-life
• Owner: juliencrn
• License: mit
• Created: 2022-01-01T19:51:29.000Z (almost 3 years ago)
• Default Branch: master
• Last Pushed: 2022-01-09T01:31:49.000Z (almost 3 years ago)
• Last Synced: 2024-10-12T01:10:01.748Z (about 1 month ago)
• Topics: canvas, js, rust, tailwindcss, vanilla-javascript, wasm, webassembly
• Language: Rust
• Homepage: https://game-of-life.juliencaron.com
• Size: 9 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        


  
Game of life


  A game-of-life implementation with Rust and WebAssembly.


  


    Tutorial

     | 

    Preview

  


  Built with 🦀🕸 by The Rust and WebAssembly Working Group





## About

The [Wikipedia definition](https://www.wikiwand.com/en/Conway%27s_Game_of_Life): 

"The 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" or "unpopulated". 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:

- Any live cell with fewer than two live neighbours dies, as if caused by underpopulation.

- Any live cell with two or three live neighbours lives on to the next generation.

- Any live cell with more than three live neighbours dies, as if by overpopulation.

- Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

The initial pattern constitutes the seed of the system. The first generation is created by applying the above rules simultaneously to every cell in the seed—births and deaths occur simultaneously, and the discrete moment at which this happens is sometimes called a tick (in other words, each generation is a pure function of the preceding one). The rules continue to be applied repeatedly to create further generations."

![demo](./demo.gif)

## 🚴 Usage

```sh

# Build 

wasm-pack build

# Test

wasm-pack test --firefox --headless

# Start the website

cd www

npm install

npm run start

# Publish on NPM

wasm-pack publish

```

## 🔋 Batteries Included

* [`wasm-bindgen`](https://github.com/rustwasm/wasm-bindgen) for communicating

  between WebAssembly and JavaScript.

* [`console_error_panic_hook`](https://github.com/rustwasm/console_error_panic_hook)

  for logging panic messages to the developer console.

* [`wee_alloc`](https://github.com/rustwasm/wee_alloc), an allocator optimized

  for small code size.