Solved

2D Array Search

Posted on 1997-07-08
2
223 Views
Last Modified: 2010-04-10
Hi!

Working on what to everyone else is a simple program but to me is proving quite difficult.  Program simulates birth and death within a two dimensional array.

Specifically, after the user specifies that life exists in say seven elements, successive generations are displayed using these two rules:

1) an organism in a cell survives to the next generation if exactly 2 or 3 of its neighbors are living, otherwise it dies

2) an organism is born into an unoccupied cell if exactly 3 of its neighbors are unoccupied.

Obviously I'm a student and I don't even know where to begin writing what is probably a series of loops to search for values in the six surrounding elements.

Would someone please show me what this code would look like and explain the why of it?

Thanks much.

Keith Connor

0
Comment
Question by:connork
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
2 Comments
 
LVL 4

Accepted Solution

by:
jos010697 earned 100 total points
ID: 1164386
For any current cell, located at position i, j, the following
loops count the number of living and dead cells:

nof_dead= 0;
nof_alive= 0;

for (di= -1; di <= 1; di++)
   for (dj= -1; dj <= 1; dj++)
      if (cell[i+di][j+dj] == dead)
         nof_dead++;
      else
         nof_alive++;

Now determine what to do with the current cell:

if (cell[i][j] == alive) {
   if (nof_alive == 2 || nof_alive == 3)
      next_cell[i[[j]= alive;
   else
      nex_cell[i][j]= dead;
}
else if (nof_alive == 3)
   next_cell[i][j]= alive;
else
   next_cell[i][j]= dead;

The array nex_cell contains the next generation of
all the cells ...

does this clarify things a bit?

kind regards,

Jos aka jos@and.nl

ps. Note that some care has to be taken for 'wrap around',
     i.e. the cells next to the border of the array must be taken
     care of in a sensible way. The normal approach is to
    define the cell array as a torus, i.e. the rightmost cells
    have the leftmost cells as their right neighbors etc.

0
 

Author Comment

by:connork
ID: 1164387
Jos,

Thanks!  Of course being a student I'm going to have to 'digest'
this :).  Also, for clarification this will only provide the results of one cell or all?

Keith Connor
 


0

Featured Post

Announcing the Most Valuable Experts of 2016

MVEs are more concerned with the satisfaction of those they help than with the considerable points they can earn. They are the types of people you feel privileged to call colleagues. Join us in honoring this amazing group of Experts.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Unlike C#, C++ doesn't have native support for sealing classes (so they cannot be sub-classed). At the cost of a virtual base class pointer it is possible to implement a pseudo sealing mechanism The trick is to virtually inherit from a base class…
This article shows you how to optimize memory allocations in C++ using placement new. Applicable especially to usecases dealing with creation of large number of objects. A brief on problem: Lets take example problem for simplicity: - I have a G…
The viewer will learn how to pass data into a function in C++. This is one step further in using functions. Instead of only printing text onto the console, the function will be able to perform calculations with argumentents given by the user.
The viewer will learn how to clear a vector as well as how to detect empty vectors in C++.

749 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question