这经典的游戏是由约翰·康威在1970年制定的元胞自动机。设置一个起始状态，通过选择（攻）细胞和游戏没有休息。 规则很简单。鉴于一代人，下一代将根据以下标准计算： - 0或1邻国的任何活细胞就会死亡，如果人口不足。 - 任何活细胞与2个或3个邻居将住到下一代。 - 4个或更多的邻居的任何活细胞就会死亡，如果人口过多。 - 任何与生活的邻居恰好3死细胞将成为一个活细胞，如果通过复制。 这些规则适用于多次从一代的未来。这是可能的创建模式仍然停留细胞，振荡从一个状态到整个电网，旅游，或生成其他模式。 This classic game is a cellular automaton devised by John Conway in 1970. Set a start state by selecting (tapping) cells, and the game does the rest. The rules are simple. Given one generation, the next generation will be calculated on the following criteria: - Any live cell with 0 or 1 neighbours will die, as if by under-population. - Any live cell with 2 or 3 neighbours will live on to the next generation. - Any live cell with 4 or more neighbours will die, as if by over-population. - Any dead cell with exactly 3 living neighbours will become a live cell, as if by reproduction. These rules are applied repeatedly from one generation to the next. It is possible to create patterns of cells that stay still, oscillate from one state to the other, travel across the grid or generate other patterns. See what you can create!