forked from ngiengkianyew/daily-coding-problem
-
Notifications
You must be signed in to change notification settings - Fork 1
/
problem_039.py
128 lines (94 loc) · 3.83 KB
/
problem_039.py
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
import sys
class Coordinate():
def __init__(self, x, y):
self.x = x
self.y = y
def __hash__(self):
return hash((self.x, self.y))
def __eq__(self, other):
return (self.x, self.y) == (other.x, other.y)
def __ne__(self, other):
return not(self == other)
def __repr__(self):
return "C(x={};y={})".format(self.x, self.y)
def get_adjacent_coordinates(self):
adjacent_coordinates = list()
adjacent_coordinates.append(Coordinate(self.x, self.y - 1))
adjacent_coordinates.append(Coordinate(self.x, self.y + 1))
adjacent_coordinates.append(Coordinate(self.x - 1, self.y))
adjacent_coordinates.append(Coordinate(self.x - 1, self.y - 1))
adjacent_coordinates.append(Coordinate(self.x - 1, self.y + 1))
adjacent_coordinates.append(Coordinate(self.x + 1, self.y))
adjacent_coordinates.append(Coordinate(self.x + 1, self.y - 1))
adjacent_coordinates.append(Coordinate(self.x + 1, self.y + 1))
return adjacent_coordinates
def get_live_coordinates(all_live_coordinates, coordinates_to_check):
count = 0
for coordinate in coordinates_to_check:
if coordinate in all_live_coordinates:
count += 1
return count
def update_liveness_neighbourhood(liveness_neighbourhood, adjacent_coordinates):
for coordinate in adjacent_coordinates:
if coordinate not in liveness_neighbourhood:
liveness_neighbourhood[coordinate] = 0
liveness_neighbourhood[coordinate] += 1
def play_iteration(board):
coordinate_set = set(board)
dead_coordinates = set()
liveness_neighbourhood = dict()
for coordinate in board:
adjacent_coordinates = coordinate.get_adjacent_coordinates()
live_adjacent_coordinate_count = get_live_coordinates(
coordinate_set, adjacent_coordinates)
update_liveness_neighbourhood(
liveness_neighbourhood, adjacent_coordinates)
if live_adjacent_coordinate_count < 2 or live_adjacent_coordinate_count > 3:
dead_coordinates.add(coordinate)
for coordinate in liveness_neighbourhood:
if liveness_neighbourhood[coordinate] == 3:
coordinate_set.add(coordinate)
new_coordinate_set = coordinate_set - dead_coordinates
return list(new_coordinate_set)
def print_board(coordinates):
min_x, min_y, max_x, max_y = sys.maxsize, sys.maxsize, -sys.maxsize, -sys.maxsize
if not coordinates:
print(".")
return
for coordinate in coordinates:
if coordinate.x < min_x:
min_x = coordinate.x
if coordinate.x > max_x:
max_x = coordinate.x
if coordinate.y < min_y:
min_y = coordinate.y
if coordinate.y > max_y:
max_y = coordinate.y
board = []
for _ in range(max_x - min_x + 1):
board.append(["."] * (max_y - min_y + 1))
for coordinate in coordinates:
board[coordinate.x - min_x][coordinate.y - min_y] = "*"
for row in board:
print(" ".join(row))
def play_game(initial_board, steps):
print("\nPlaying Game of Life with the intial board:")
print_board(initial_board)
current_board = initial_board
for step in range(steps):
current_board = play_iteration(current_board)
print("Iteration: {}".format(step))
print_board(current_board)
# board is a list of Coordinates
board_0 = [
Coordinate(0, 0), Coordinate(1, 0), Coordinate(1, 1), Coordinate(1, 5)]
play_game(board_0, 3)
board_1 = [
Coordinate(0, 0), Coordinate(1, 0), Coordinate(1, 1), Coordinate(1, 5),
Coordinate(2, 5), Coordinate(2, 6)]
play_game(board_1, 4)
board_2 = [
Coordinate(0, 0), Coordinate(1, 0), Coordinate(1, 1),
Coordinate(2, 5), Coordinate(2, 6), Coordinate(3, 9),
Coordinate(4, 8), Coordinate(5, 10)]
play_game(board_2, 4)