#GAME OF LIFE CONWAY JAVA HOW TO#
#GAME OF LIFE CONWAY JAVA CODE#

#GAME OF LIFE CONWAY JAVA CODE#

What can I improve on? Are there faster ways to implement certain areas of my code? Is there excess code that I can trim away? Is there a smarter way of implementing Conway's Game of Life? Life/death rules for other cells to take into account the number ofĪdjacent edge cells as well as the number of adjacent live cells.Īaah.I see.thanks for the explanation.I have just finished implementing a version of Conway's Game of Life using Java.īeing only a college student, I am sure that my code is no where near perfect, and was wondering if you could look at my code. Regardless of the state of its neighbours. If you want to do the wrapping, use % as Simon Righarts suggested.Īnother general approach to edges is add a border of non-displayed cellsĪround the outside of your displayed cells, increasing each dimension by I know that for the first row (excluding the > easier if I just find a way to check the edges while keeping it a

> get how that works in terms of the coding, so I'm guessing it may be > one idea would be to make the board wrap around, but I don't really > I am ignoring them so they just stay at their default values).

#GAME OF LIFE CONWAY JAVA HOW TO#

> but I am stuck as to how to go about checking all the edges (right now > I am working on programming a simple version of Conway's Game of Life, Used to represent the chance that any given cell will be set to alive :-) I've done the initial setup a little differently too. With me? If you ain't, I've posted my code - it's an extension of yourĬoncept, with variable width & height - modify x & y to change dimensions. Still -1 (we'd then get a ArrayIndexOutOfBoundsException), we add x so we Number before that, spitting out a number -x > n > x. Spot the difference? Basically, '% x' removes any multiples of x from the The actual edge correction is inside the array reference: X and y are static data fields, set to the dimensions of the array, row &Ĭol are the position you're currently interested in, and the bit that does Public static int numOfNeighbors(int row,int col) I posted this over in c.l.j.programmer as well, but I guess you didn't seeĪssuming you're still running with the same example I fixed for you inĬ.l.j.p, then this is how I did edge-testing =-P (I just can't figure out wha thte conditions for each loop andĪny help you could provide would be greatly appreciated =) (phew!) but my problem is I'm not quite sure how to put that intoĪctual code though I'm smelling some more for loops and conditionals Similarly for the first column you would check:įinally, for the CORNERS, you would check: ,, ,, Īnd for the last row, which is somewhat simmilar you would check: Get how that works in terms of the coding, so I'm guessing it may beĮasier if I just find a way to check the edges while keeping it aįinite and bounded board. One idea would be to make the board wrap around, but I don't really I am ignoring them so they just stay at their default values). I am working on programming a simple version of Conway's Game of Life,īut I am stuck as to how to go about checking all the edges (right now

Game of life conway java