Cody

# Problem 52. What is the next step in Conway's Life?

Solution 2130899

Submitted on 17 Feb 2020 by Haotian_W
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
A = [ ... 1 1 0 0 0 1 0 0 1 1 0 0 0 0 0 0]; B = [ ... 1 1 0 0 0 0 1 0 1 1 0 0 0 0 0 0]; assert(isequal(gameOfLife(A),B))

A_count = NaN 0 0 0 1 1 0 0 1 A_count = 0 0 0 1 1 0 0 1 0 A_count = 0 0 0 1 0 0 1 0 0 A_count = 0 0 NaN 0 0 1 0 0 0 A_count = 0 1 1 0 0 1 0 1 1 A_count = 1 1 0 0 1 0 1 1 0 A_count = 1 0 0 1 0 0 1 0 0 A_count = 0 0 1 0 0 0 0 0 1 A_count = 0 0 1 0 1 1 0 0 0 A_count = 0 1 0 1 1 0 0 0 0 A_count = 1 0 0 1 0 0 0 0 0 A_count = 0 0 0 0 0 1 0 0 0 A_count = 0 1 1 0 0 0 NaN 1 1 A_count = 1 1 0 0 0 0 1 1 0 A_count = 1 0 0 0 0 0 1 0 0 A_count = 0 0 1 0 0 0 0 0 NaN

2   Pass
A = [ ... 0 1 1 0 1 1 1 0 0 0 1 0 0 0 0 0]; B = [ ... 1 0 1 1 1 0 0 0 0 0 1 1 0 1 1 0]; assert(isequal(gameOfLife(A),B))

A_count = NaN 0 0 0 0 1 0 1 1 A_count = 0 0 0 0 1 1 1 1 1 A_count = 0 0 0 1 1 0 1 1 0 A_count = 0 0 NaN 1 0 0 1 0 1 A_count = 0 0 1 0 1 1 0 0 0 A_count = 0 1 1 1 1 1 0 0 1 A_count = 1 1 0 1 1 0 0 1 0 A_count = 1 0 0 1 0 1 1 0 0 A_count = 0 1 1 0 0 0 0 0 0 A_count = 1 1 1 0 0 1 0 0 0 A_count = 1 1 0 0 1 0 0 0 0 A_count = 1 0 1 1 0 0 0 0 0 A_count = 0 0 0 0 0 0 NaN 0 1 A_count = 0 0 1 0 0 0 0 1 1 A_count = 0 1 0 0 0 0 1 1 0 A_count = 1 0 0 0 0 0 1 0 NaN