WeGo for Golang vs Alive or Dead: Game of Life Utilisation & Stats

【示例】 Example示例来自于 https://github.com/gobyexample-cn/gobyexample,网站https://gobyexample-cn.github.io/ Go by Example 是一个通过带注释的示例程序学习 Go 语言的网站。网站包含了从简单的 Hello World 到高级特性 Goroutine、Channel 等一系列示例程序,并附带了注释说明,非常适合 Go 语言初学者。 如果您想学习 Go 语言基础知识,不要犹豫,请直接前往 Go by Example 开始学习! 【题解】 精选了具有代表性的算法题,使用Go语言实现相关的数据结构与算法分析
  • Apple App Store
  • Gratuit
  • Outils de développement

Classement dans le store

- -

The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. The game is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. It is Turing complete and can simulate a universal constructor or any other Turing machine. 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 and unpopulated, respectively). 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: 1. Any live cell with fewer than two live neighbours dies, as if by 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, as if by overpopulation. 4. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction. These rules, which compare the behavior of the automaton to real life, can be condensed into the following: 1. Any live cell with two or three neighbors survives. 2. Any dead cell with three live neighbors becomes a live cell. 3. All other live cells die in the next generation. Similarly, all other dead cells stay dead. 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. Each generation is a pure function of the preceding one. The rules continue to be applied repeatedly to create further generations.
  • Apple App Store
  • Gratuit
  • Outils de développement

Classement dans le store

- -

Comparaison des classements WeGo for Golang vs. Alive or Dead: Game of Life

Comparez l'évolution du classement de WeGo for Golang au cours des 28 derniers jours à celle de Alive or Dead: Game of Life.

Alive or Dead: Game of LifeAlive or Dead: Game of Life- -

Rank

Comparaison des classements WeGo for Golang et Alive or Dead: Game of Life par pays

Comparez l'évolution du classement de WeGo for Golang au cours des 28 derniers jours à celle de Alive or Dead: Game of Life.

Toutes les catégories

Aucune donnée disponible

Outils de développement

Comparez avec n'importe quel site grâce à notre essai gratuit

Démarrer
WeGo for Golang VS.
Alive or Dead: Game of Life

11écembre d, 2024