blob: d05038fb8abfa581fc15c68131bb9b07d8cee9e5 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
; This board is 8 * 8 = 64 cells.
; let n_cells = 64
; let board_a: int[64]
; let board_b: int[64]
; let stride = 8
; This board is 32 * 32 = 1024 cells.
let n_cells = 1024
let board_a: int[1024]
let board_b: int[1024]
let stride = 32
; Storing pointers to the front/backbuffer to avoid copying the board over.
let front = board_a
let back = board_b
; Initialize glider
set front[stride * 2 + 5] = 1
set front[stride * 3 + 6] = 1
set front[stride * 4 + 4] = 1
set front[stride * 4 + 5] = 1
set front[stride * 4 + 6] = 1
fun print_board(board: @int): nil {
let i = 0
while i < n_cells {
if i % stride == 0 {
println("")
}
if board[i] == 1 print("■ ")
else print("· ")
set i = i + 1
}
println("")
}
fun update_board(): nil {
let i = 0
while i < n_cells {
let left = if i > 0 front[i - 1] else 0
let right = if i < n_cells - 1 front[i + 1] else 0
let top = if i >= stride front[i - stride] else 0
let topleft = if i >= stride front[i - stride - 1] else 0
let topright = if i >= stride front[i - stride + 1] else 0
let bot = if i <= n_cells - stride front[i + stride] else 0
let botleft = if i <= n_cells - stride front[i + stride - 1] else 0
let botright = if i <= n_cells - stride front[i + stride + 1] else 0
let neig = left
+ right
+ top
+ bot
+ topleft
+ topright
+ botleft
+ botright
cond {
front[i] == 0 && neig == 3 = set back[i] = 1
front[i] == 1 && (neig == 2 || neig == 3) = set back[i] = 1
else = set back[i] = 0
}
set i = i + 1
}
let tmp = front
set front = back
set back = tmp
}
let n_iter = 1000
while n_iter > 0 {
set n_iter = n_iter - 1
print_board(front)
update_board()
}
|
