typescript/app/life.ts · 2491 字节 · 下载原文
// 康威生命游戏(滑翔机 Glider)—— 小应用:二维网格用一维数组表示
// Conway's Game of Life (a single glider) -- 2D grid encoded in a flat array
//
// 来源 / Source: Rosetta Code「Conway's Game of Life」JavaScript 条目(GFDL 1.2 / CC-BY-SA 3.0)
// https://rosettacode.org/wiki/Conway%27s_Game_of_Life
const W: number = 10;
const H: number = 10;
function idx(x: number, y: number): number {
return y * W + x;
}
// 0 = 死,1 = 活(一维数组:`y * W + x`)
let grid: number[] = [];
let next: number[] = [];
for (let i: number = 0; i < W * H; i = i + 1) {
grid[i] = 0;
next[i] = 0;
}
// 滑翔机:三行只亮几个格
function seed(x: number, y: number): void {
grid[idx(x + 1, y)] = 1;
grid[idx(x + 2, y + 1)] = 1;
grid[idx(x, y + 2)] = 1;
grid[idx(x + 1, y + 2)] = 1;
grid[idx(x + 2, y + 2)] = 1;
}
seed(2, 2);
function neighbours(x: number, y: number): number {
let n: number = 0;
let dy: number = -1;
while (dy <= 1) {
let dx: number = -1;
while (dx <= 1) {
if (dx !== 0 || dy !== 0) {
const nx: number = x + dx;
const ny: number = y + dy;
if (nx >= 0 && nx < W && ny >= 0 && ny < H) {
n = n + grid[idx(nx, ny)];
}
}
dx = dx + 1;
}
dy = dy + 1;
}
return n;
}
function step(): void {
for (let y: number = 0; y < H; y = y + 1) {
for (let x: number = 0; x < W; x = x + 1) {
const n: number = neighbours(x, y);
const alive: number = grid[idx(x, y)];
if (alive === 1 && (n === 2 || n === 3)) {
next[idx(x, y)] = 1;
} else if (alive === 0 && n === 3) {
next[idx(x, y)] = 1;
} else {
next[idx(x, y)] = 0;
}
}
}
for (let i: number = 0; i < W * H; i = i + 1) {
grid[i] = next[i];
}
}
function draw(gen: number): void {
print_str("第 " + gen + " 代 / generation " + gen + ":\n");
for (let y: number = 0; y < H; y = y + 1) {
let line: string = "";
for (let x: number = 0; x < W; x = x + 1) {
if (grid[idx(x, y)] === 1) {
line = line + "#";
} else {
line = line + ".";
}
}
print_str(line + "\n");
}
print_str("\n");
}
draw(0);
step();
draw(1);
step();
draw(2);