This application is a cellular automaton, and is best described here by Wikipedia --> link. By downloading and extracting the zip file you can open applet.htm which will do a demonstration. I just can't run the applet on this webserver.This application will simulate life by representing each by cells. The rules are as follows (taken from Wikipedia): *************************************************************************************** The universe of the Game of Life is an infinite two-dimensional orthogonal grid of square - Any live cell with fewer than two live neighbours dies, as if by loneliness.
- Any live cell with more than three live neighbours dies, as if by overcrowding.
- Any live cell with two or three live neighbours lives, unchanged, to the next generation.
- Any dead cell with exactly three live neighbours comes to life.
The
initial pattern constitutes the 'seed' of the system. The first
generation is created by applying the above rules simultaneously to
every cell in the seed-- births and deaths happen simultaneously, and
the discrete moment at which this happens is sometimes called a **************************************************************************************** A quarter of the project was getting it to work correctly, the rest was performance. Our game of life has no boundaries, and both directions extend out to infinity, essentially creating an infinite plane. The description of this project is affixed below in the attachments, and is quite a good read to understand how the program works. My partner Catalina and I worked very hard at obtaining excellent performance metrics on this project, and indeed it did pay off.
View below for a full source code and binaries. It is also possible to obtain a report below. |