I've finally made up my own version of Conway's Game of Life for the TI-83+. It's a simple simulation with only a few rules. Each cell has 9 neighbours, adjacent or diagonal to it. In each round, every cell with two or three neighbours survives and all others dies. Empty spaces with 3 neighbours spawn a new cell. Once again, I'm hoping someone already familiar with the simulation reads this. My program works, but it's farking slow. Could anyone suggest a more efficient way of doing this?
I don't think I've seen you here before… Welcome to the TI Basic Developer! You may want to become a member.
Thanks for the tip. I had a look at DarkLine's version and from what I can tell it's more efficient than mine, but I've had trouble evaluating it because it's just a routine, not a full program. And I'm still not sure how it works. And off topic: Cool website.