-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
71 lines (65 loc) · 1.88 KB
/
index.html
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
<!doctype html>
<html>
<head>
<title>Game of Life</title>
<style>
body {
background-color: #fed;
font-family: Helvetica;
margin: 10px;
}
p {
font-size: 14px;
}
#world-container {
background-color: #fff;
border: 3px solid #aaa;
float: left;
margin-right: 15px;
-webkit-box-shadow: 3px 3px 3px #666;
-webkit-border-radius: 2px;
}
#world {
border-collapse: collapse;
}
#world td {
border: 1px solid #aaa;
padding: 0;
}
#world td div {
width: 4px;
height: 4px;
}
#world td div.alive {
background-color: #222;
}
</style>
<script src="dist/bundle.js"></script>
</head>
<body>
<h2>Conway's Game of Life</h2>
<div id="world-container">
<table id="world"></table>
</div>
<p>
Conway was interested in a problem presented in the 1940s by renowned
mathematician John von Neumann, who tried to find a hypothetical
machine that could build copies of itself, and succeeded when he
found a mathematical model for such a machine with very complicated
rules on a rectangular grid. The Game of Life emerged as Conway's
successful attempt to simplify von Neumann's ideas.
</p>
<p>
During this early research, Conway discovered that the F-pentomino
(which he called the "R-pentomino") failed to stabilize in a small
number of generations. In fact, it takes 1103 generations to stabilize,
by which time it has a population of 116 and has fired six escaping
gliders (in fact, these were the first gliders ever discovered).
</p>
<cite>
<a href="http://en.wikipedia.org/wiki/Conway's_Game_of_Life">
http://en.wikipedia.org/wiki/Conway's_Game_of_Life
</a>
</cite>
</body>
</html>