Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Fast way to update grids

15 views
Skip to first unread message

David E. Hiebeler

unread,
Jan 26, 1988, 11:40:45 PM1/26/88
to

I've been working on a project for some time now which reads in an
algorithm, and writes a C program to run some 2-D automata. It's coming
along pretty well now, but now I'd like to get some input from people 'out
there.'
Basically, I'm looking for a fast (the fastest?) way of updating
grids, where each cell has to look at an arbitrary number of its neighbors.
I've seen some fast life-programs, but often they took advantage of particular
quirks of the the rules of Life.
I need some method more general. I've tried the simple method,
storing the grid in an array, and simply using 2 indices to cover the grid,
and each cell stores its new value in a 2nd copy of the grid. Say you have 5
neighbors, then each cell requires 5 things like "grid[x][y+1]" for example
to get the value of its south neighbor.
I tried a field of linked nodes; i defined a whole bunch of structs,
and each cell had a value, plus the structure contained pointers to all of
its neighbors. So the south neighbor might be (cell.south).value for example.
Both methods ran at about the same speed (this was on a Sequent
Balance 21000, using C).

Does anyone out there have some useful tips on what I can do to
speed up the program? Any comments would be greatly appreciated...
Thanks,
Dave Hiebeler Internet: hieb...@csv.rpi.edu (preferred address)
R.D. Box 225A hieb...@b21.cs.rpi.edu
Chatham, NY 12037 userfrzk%mts.r...@itsgw.rpi.edu
Bitnet: user...@rpitsmts.bitnet

----
David Hiebeler hieb...@csv.rpi.edu
Troy, NY "Wo bu jidow wo tzai
shua shumua"

0 new messages