How can i make John Conway's Game of Life in visual basic 2008 lllllUPDATElllll can someone answer please?

Answer 1

Implementation of John Horton Conway's "Game of Life", a topic of Cellular Automata written in Scientific American, is not a simple project, and no one is going to give you code or take the time to write it for you. You must do that yourself. We can and will discuss the process... You need an array, representing the life matrix. Each element is a cell that is dead or alive. On each generation, you apply the following rules... 1. If a cell is alive, it survives if it has two or three adjacent alive neighbors.

2. If a cell is dead, it is born if it has three adjacent alive neighbors.

3. Otherwise, the cell dies or stays dead. It is important to note that this processing must be performed "in parallel", without allowing intermediate results to "contaminate" the procedure of creating a new generation. This usually means that you need two copies of the array. You need a way to initialize or load the array. You need a way to display the array, allowing for sizing, shifting, window changes, etc. You need a way to control the process, starting, stopping, saving, detecting stability or oscillation, etc. In modern compilers and operating systems, memory space is not an issue, so you could just implement the array. Providing for dynamic sizes is possible (and appropriate) because you don't know how large something is going to be, or you don't know where the colony is going to move. Some implementations have solved the memory size or dynamic size issue by providing sophisticated means of representing the matrix, such as with a linked list of partial regions of the array that can grow, contract, split, and merge as needed. Technically, the array is a bit array, because each cell only has two states, dead or alive. Bit manipulation, however, can be CPU intensive, slowing down the process. The other potentially large issue is locality and temporality of reference. The array is a large object. If you are bouncing around in memory scanning and updating it, you are going to have constant cache flushes, both in L1 and L2. This is going to degrade performance. Does this matter? Its up to you. If you can manage to process the array serially, with only a few data pathes going through the array, performance will be excellent.