Програмиране с Ruby

Курс във Факултета по Математика и Информатика към СУ

Решение на Шеста задача от Димитър Димитров

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

Към профила на Димитър Димитров

Резултати

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

Код

module GameOfLife
module Rules
def newborn_cells
map do |cell|
neighbours_of(cell).select { |neighbour| 3 == alive_neighbours_count_of(neighbour) }
end.flatten(1)
end
def stable_cells
select { |cell| (2..3) === alive_neighbours_count_of(cell) }
end
end
class Board
include Enumerable
include Rules
def initialize(*cells)
live_cells = cells.map { |cell| [key(cell), true] }
@cells = Hash[*live_cells.flatten]
end
def each
@cells.each do |key, alive|
yield coords(key) if alive
end
end
def [](x, y)
@cells[key(x, y)] == true
end
def next_generation
Board.new *(stable_cells + newborn_cells)
end
private
def neighbours_of(*cell)
x, y = [cell].flatten
[
[x - 1, y + 1], [x, y + 1], [x + 1, y + 1],
[x - 1, y ], [x + 1, y ],
[x - 1, y - 1], [x, y - 1], [x + 1, y - 1],
]
end
def alive_neighbours_count_of(*cell)
neighbours_of(cell).count { |x, y| self[x, y] }
end
def coords(key)
key.split('.').map(&:to_i)
end
def key(*cell)
x, y = [cell].flatten
"#{x}.#{y}"
end
end
end

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

..................

Finished in 0.46433 seconds
18 examples, 0 failures

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

Димитър обнови решението на 14.12.2011 02:31 (преди около 13 години)

+module GameOfLife
+ module Rules
+ def newborn_cells
+ map do |cell|
+ neighbours_of(cell).select { |neighbour| 3 == alive_neighbours_count_of(neighbour) }
+ end.flatten(1)
+ end
+
+ def stable_cells
+ select { |cell| (2..3) === alive_neighbours_count_of(cell) }
+ end
+ end
+
+ class Board
+ include Enumerable
+ include Rules
+
+ def initialize(*cells)
+ live_cells = cells.map { |cell| [key(cell), true] }
+ @cells = Hash[*live_cells.flatten]
+ end
+
+ def each
+ @cells.each do |key, alive|
+ yield coords(key) if alive
+ end
+ end
+
+ def [](x, y)
+ @cells[key(x, y)] == true
+ end
+
+ def next_generation
+ Board.new *(stable_cells + newborn_cells)
+ end
+
+ private
+
+ def neighbours_of(*cell)
+ x, y = [cell].flatten
+
+ [
+ [x - 1, y + 1], [x, y + 1], [x + 1, y + 1],
+ [x - 1, y ], [x + 1, y ],
+ [x - 1, y - 1], [x, y - 1], [x + 1, y - 1],
+ ]
+ end
+
+ def alive_neighbours_count_of(*cell)
+ neighbours_of(cell).count { |x, y| self[x, y] }
+ end
+
+ def coords(key)
+ key.split('.').map(&:to_i)
+ end
+
+ def key(*cell)
+ x, y = [cell].flatten
+
+ "#{x}.#{y}"
+ end
+ end
+end