From 7913e28fe941e7269bd791f6809bc1f068138067 Mon Sep 17 00:00:00 2001 From: "joachim.schmidt" <joachim.schmidt@hesge.ch> Date: Fri, 14 Mar 2025 10:08:07 +0100 Subject: [PATCH] README.md has been updated and gol.md has been added. --- fractal_project/README.md | 10 ++++++++-- fractal_project/gol.md | 18 ++++++++++++++++++ 2 files changed, 26 insertions(+), 2 deletions(-) create mode 100644 fractal_project/gol.md diff --git a/fractal_project/README.md b/fractal_project/README.md index 459f019..8cc4c4d 100644 --- a/fractal_project/README.md +++ b/fractal_project/README.md @@ -54,8 +54,14 @@ Each student will have to propose either a parallel or pipelined architecture. F  -### Game of life with **high-speed links** +# Game of Life with **high-speed links** -An alternative is to implement a **game of life** where the game board is on two boards with two screens. The boards communicate through high-speed serial links. +## How to calculate them + +1. [Game of Life](./gol.md) + +## Work proposals + +An alternative is to implement a **Game of Life** where the game board is on two boards with two screens. The boards communicate through high-speed serial links.  diff --git a/fractal_project/gol.md b/fractal_project/gol.md new file mode 100644 index 0000000..1a247cb --- /dev/null +++ b/fractal_project/gol.md @@ -0,0 +1,18 @@ +# Game of Life + +The **Game of Life** by John Conway is a cellular automaton, where cells evolve over discrete time steps according to a set of simple rules. Each cell can be either **alive** or **dead** in the grid, and its state changes depending on the number of its neighbours. + +Here are the rules of Conway's Game of Life: + +> 1. **Any live cell with fewer than two live neighbours dies (underpopulation)**. +> 2. **Any live cell with two or three live neighbours lives on to the next generation**. +> 3. **Any live cell with more than three live neighbours dies (overpopulation)**. +> 4. **Any dead cell with exactly three live neighbours becomes a live cell (reproduction)**. + +Key points: + +> * The game is played on a 2D grid where each cell can be in one of two states: **alive** (1) or **dead** (0). +> * The grid is usually considered to have infinite size, but for practical purposes, it is often limited to a finite size. +> * The **neighbours** of a cell are the 8 cells surrounding it (in a 3x3 grid excluding the cell itself). + +By appliying there simple rules, the configuration of the grid evolves over time, sometimes leading to interesting patterns like oscillators, gliders, or still lifes. -- GitLab