Решение на Игра на живот от Мирослав Шипковенски

Обратно към всички решения

Към профила на Мирослав Шипковенски

Резултати

  • 6 точки от тестове
  • 0 бонус точки
  • 6 точки общо
  • 1 успешни тест(а)
  • 0 неуспешни тест(а)

Код

#!/usr/bin/env python3
import os
import time
from random import Random
BOARD_SIZE = 48
def print_board(board, wait=False, sleep=False):
os.system(['clear', 'cls'][os.name == 'nt'])
print('=' * (BOARD_SIZE + 2), end='|\n')
for row in board:
print(*['X' if x else ' ' for x in row], end=' |\n', sep='')
print([[x & 1 for x in row] for row in board])
input("Press enter to continue.")
def create_board(fill_rate=0.3):
rand = Random()
return [[int(x and x != BOARD_SIZE + 1 and y and y != BOARD_SIZE + 1
and rand.normalvariate(0.5, 0.2) < fill_rate)
for x in range(0, BOARD_SIZE + 2)]
for y in range(0, BOARD_SIZE + 2)]
def step_board(board):
new_board = []
for x in range(1, BOARD_SIZE + 1):
new_board.append([0])
for y in range(1, BOARD_SIZE + 1):
live_cells = count_neighbors(x, y, board)
future_cell = int(will_survive(board[x][y], live_cells))
new_board[x - 1].append(future_cell)
new_board[x - 1].append(0)
board[1:BOARD_SIZE + 1] = new_board
def will_survive(cell, neighbors):
if cell == 0 and neighbors == 3:
return True
if cell == 1 and neighbors in [2, 3]:
return True
return False
def count_neighbors(x, y, board):
neighbors = 0
for dx in [-1, 0, 1]:
for dy in [-1, 0, 1]:
neighbors += board[x + dx][y + dy]
neighbors -= board[x][y]
return neighbors
if __name__ == '__main__':
board = create_board()
while True:
step_board(board)
print_board(board)

Лог от изпълнението

.
----------------------------------------------------------------------
Ran 1 test in 0.187s

OK

История (1 версия и 0 коментара)

Мирослав обнови решението на 29.03.2012 23:51 (преди над 8 години)

+#!/usr/bin/env python3
+import os
+import time
+from random import Random
+
+BOARD_SIZE = 48
+
+
+def print_board(board, wait=False, sleep=False):
+ os.system(['clear', 'cls'][os.name == 'nt'])
+ print('=' * (BOARD_SIZE + 2), end='|\n')
+ for row in board:
+ print(*['X' if x else ' ' for x in row], end=' |\n', sep='')
+ print([[x & 1 for x in row] for row in board])
+ input("Press enter to continue.")
+
+
+def create_board(fill_rate=0.3):
+ rand = Random()
+ return [[int(x and x != BOARD_SIZE + 1 and y and y != BOARD_SIZE + 1
+ and rand.normalvariate(0.5, 0.2) < fill_rate)
+ for x in range(0, BOARD_SIZE + 2)]
+ for y in range(0, BOARD_SIZE + 2)]
+
+
+def step_board(board):
+ new_board = []
+ for x in range(1, BOARD_SIZE + 1):
+ new_board.append([0])
+ for y in range(1, BOARD_SIZE + 1):
+ live_cells = count_neighbors(x, y, board)
+ future_cell = int(will_survive(board[x][y], live_cells))
+ new_board[x - 1].append(future_cell)
+ new_board[x - 1].append(0)
+ board[1:BOARD_SIZE + 1] = new_board
+
+
+def will_survive(cell, neighbors):
+ if cell == 0 and neighbors == 3:
+ return True
+ if cell == 1 and neighbors in [2, 3]:
+ return True
+ return False
+
+
+def count_neighbors(x, y, board):
+ neighbors = 0
+ for dx in [-1, 0, 1]:
+ for dy in [-1, 0, 1]:
+ neighbors += board[x + dx][y + dy]
+ neighbors -= board[x][y]
+ return neighbors
+
+
+if __name__ == '__main__':
+ board = create_board()
+ while True:
+ step_board(board)
+ print_board(board)