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?

Conway's Game of Life

Summary:

See Wikipedia if you don't know about Conway's game of life. (Not to be confused with the board game)