Your method looks classy! No idea what’s wrong. FWIW, I took the initial grid, adding enough empty planes so that no edge planes could be occupied in the required number of generations, set up a 26 * 3 array of offsets, 111,110,101, ... , -101, -110, -111, (omitting spaces) and then ravelled the data and changed the offsets to a vector using shape #: offsets. It was easy then to get the number of live neighbours for each point. Crude, but fast enough.
It was tempting to dig up Life in the J Wiki. Cheers, Mike Sent from my iPad > On 20 Dec 2020, at 16:27, David Lambert <b49p23t...@gmail.com> wrote: > > free invalid pointer > > I haven't taken steps to isolate the problem. > > Files in https://code.jsoftware.com/wiki/David_Lambert/Crash > > $ ijconsole > JVERSION > Engine: j902/j64/linux > Release-a: commercial/2020-12-05T11:11:55 > Library: 9.02.08 > Platform: Linux 64 > Installer: unknown > InstallPath: /usr/share/j/9.02 > Contact: www.jsoftware.com > > > happy holidays to all! > > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
