projects

Conway's Game of Life

An interactive implementation of Conway’s Game of Life, demonstrating high-performance browser-based computation using Rust compiled to WebAssembly.

About

Conway’s Game of Life is a cellular automaton where cells evolve based on simple rules:

  • Any live cell with 2-3 neighbors survives
  • Any dead cell with exactly 3 neighbors becomes alive
  • All other cells die or stay dead

Despite these simple rules, the Game of Life produces complex emergent patterns and behaviors.

Features

  • High Performance - Rust compiled to WASM for efficient computation
  • Interactive Simulation - Real-time visualization in the browser
  • Cellular Automaton Engine - Implements classic Conway’s rules
  • Browser-Based - No installation required, runs entirely in the browser

Technologies Used

  • Rust - Core simulation logic and performance-critical code
  • WebAssembly - Compiles Rust to browser-executable format
  • JavaScript - Frontend interaction and rendering
  • HTML/CSS - User interface and controls