minmax for conway's game of life in matlab

main.m
% Define initial state of the grid
grid = [0 0 0 0 0 0 0;
        0 0 1 0 0 0 0;
        0 0 0 1 0 0 0;
        0 1 1 1 0 0 0;
        0 0 0 0 0 0 0;
        0 0 0 0 0 0 0;
        0 0 0 0 0 0 0];

% Set number of iterations
num_iterations = 100;

% Initialize minimum and maximum values
min_values = [];
max_values = [];

% Apply rules of the game for a certain number of iterations
for i = 1:num_iterations
    % Calculate next state of grid
    next_grid = zeros(size(grid)); % Initialize next grid
    for r = 1:size(grid, 1) % Loop over rows
        for c = 1:size(grid, 2) % Loop over columns
            % Count number of alive neighbors
            num_neighbors = sum(sum(grid(max(1,r-1):min(size(grid,1),r+1), max(1,c-1):min(size(grid,2),c+1))) - grid(r,c));

            % Apply rules of the game
            if grid(r,c) == 1 && (num_neighbors < 2 || num_neighbors > 3)
                next_grid(r,c) = 0; % Cell dies
            elseif grid(r,c) == 0 && num_neighbors == 3
                next_grid(r,c) = 1; % Cell is born
            else
                next_grid(r,c) = grid(r,c); % Cell stays the same
            end
        end
    end

    % Update minimum and maximum values
    min_value = min(min(next_grid));
    max_value = max(max(next_grid));
    min_values = [min_values min_value];
    max_values = [max_values max_value];

    % Check for stable state or oscillating pattern
    if isequal(grid, next_grid)
        fprintf('Stable state reached after %d iterations\n', i);
        break;
    elseif i > 1 && isequal(next_grid, old_grid)
        fprintf('Oscillating pattern reached after %d iterations\n', i);
        break;
    end
    
    % Update grid and continue iterating
    old_grid = grid; % Save previous grid
    grid = next_grid; % Update current grid
end
1800 chars
56 lines