grid counting

[casper7]

hello
i'm writing the code for "The Game of Life".
i'll explain, i get grid dimensions from the user, and in every cell there's either
'-','R' or 'G'.
now i need to go threw the grid and count how many R's and G's are adjacent to that cell.
the problem arises when the i'm going threw the edge rows (1st and last) and columns (1st and last).
i KNOW i can solve it somehow using a modulu, but i'm not sure how.

Thank you for your attention, have a nice day

[Adak]

hello
i'm writing the code for "The Game of Life".
i'll explain, i get grid dimensions from the user, and in every cell there's either
'-','R' or 'G'.
now i need to go threw the grid and count how many R's and G's are adjacent to that cell.
the problem arises when the i'm going threw the edge rows (1st and last) and columns (1st and last).
i KNOW i can solve it somehow using a modulu, but i'm not sure how.

Thank you for your attention, have a nice day

Leaving a border row and column is helpful. Don't use the zero'th row or zero'th column. That gives you a left and top side border. Make the array two rows more than the user requests, and two columns, also. That would give you a border all the way around the life board array.

Modulus can be used like so:

for(row = 1; (row % row_num+1) > 0; row++)   {
   for(col = 1; (col % col_num+1) > 0; col++)   {
      //your sqr checking logic, here - sqr is dead, sqr is alive, etc.

   }
}

[QuantumPete]

i KNOW i can solve it somehow using a modulu, but i'm not sure how.

Hmm, if I'm not mistaken, modulo would "wrap-around" the board edges. I doubt that's what you want. It's been a while since I've played the Game of Life, but I don't recall the bottom row counting towards a top-row-square's neighbours.
You could just use an if condition that doesn't perform the check for the squares below the current square if the current square is on the bottom row, and so on for all edges. That'll take care of the corners automatically for you.

QuantumPete