<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="et">
	<id>http://www.lambda.ee/w/index.php?action=history&amp;feed=atom&amp;title=Game_of_life_k%C3%A4surealt</id>
	<title>Game of life käsurealt - Redigeerimiste ajalugu</title>
	<link rel="self" type="application/atom+xml" href="http://www.lambda.ee/w/index.php?action=history&amp;feed=atom&amp;title=Game_of_life_k%C3%A4surealt"/>
	<link rel="alternate" type="text/html" href="http://www.lambda.ee/w/index.php?title=Game_of_life_k%C3%A4surealt&amp;action=history"/>
	<updated>2026-10-28T11:51:15Z</updated>
	<subtitle>Selle lehekülje redigeerimiste ajalugu</subtitle>
	<generator>MediaWiki 1.43.11</generator>
	<entry>
		<id>http://www.lambda.ee/w/index.php?title=Game_of_life_k%C3%A4surealt&amp;diff=8189&amp;oldid=prev</id>
		<title>Tammet – 10. oktoober 2008, kell 09:40</title>
		<link rel="alternate" type="text/html" href="http://www.lambda.ee/w/index.php?title=Game_of_life_k%C3%A4surealt&amp;diff=8189&amp;oldid=prev"/>
		<updated>2008-10-10T09:40:26Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Uus lehekülg&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&amp;lt;pre&amp;gt;&lt;br /&gt;
public class Life {                &lt;br /&gt;
           &lt;br /&gt;
  public static void main(String[] args) {  &lt;br /&gt;
    int steps;&lt;br /&gt;
    int[][] cells;&lt;br /&gt;
    int[][] newcells;  &lt;br /&gt;
    int[][] tmpcells; // temporary array pointer, not allocated&lt;br /&gt;
    int count;&lt;br /&gt;
      &lt;br /&gt;
    cells=new int[20][20];&lt;br /&gt;
    newcells=new int[20][20];  &lt;br /&gt;
    initCells(cells);&lt;br /&gt;
      &lt;br /&gt;
    System.out.println(&amp;quot;Life starts!&amp;quot;);&lt;br /&gt;
    for(steps=0; steps&amp;lt;100; steps++) {&lt;br /&gt;
      System.out.println(&amp;quot;Step nr: &amp;quot;+steps);&lt;br /&gt;
      printCells(cells);&lt;br /&gt;
      count=countCells(cells);&lt;br /&gt;
      if (count==0) {&lt;br /&gt;
        System.out.println(&amp;quot;Everybody dead at step nr: &amp;quot;+steps);&lt;br /&gt;
        break;            &lt;br /&gt;
      }   &lt;br /&gt;
      compNextGen(cells,newcells);      &lt;br /&gt;
      // swap two arrays: cells will become newcells, and vice versa  &lt;br /&gt;
      tmpcells=cells;  &lt;br /&gt;
      cells=newcells;&lt;br /&gt;
      newcells=tmpcells;        &lt;br /&gt;
    }&lt;br /&gt;
  }&lt;br /&gt;
  &lt;br /&gt;
  &lt;br /&gt;
  // compute next generation of cells:&lt;br /&gt;
  // old: cells as they were before, will not be changed&lt;br /&gt;
  // next: next generation of cells, written anew&lt;br /&gt;
  &lt;br /&gt;
  static void compNextGen(int[][] old,int[][] next) {&lt;br /&gt;
    int row,col;&lt;br /&gt;
    int n;  &lt;br /&gt;
    for(row=0;row&amp;lt;old.length;row++) {&lt;br /&gt;
      for(col=0;col&amp;lt;old[row].length;col++) {&lt;br /&gt;
        // compute nr of neighbours of one cell &lt;br /&gt;
        n=cval(old,row-1,col-1)+cval(old,row-1,col)+&lt;br /&gt;
            cval(old,row-1,col+1);&lt;br /&gt;
        n=n+cval(old,row,col-1)+cval(old,row,col+1);&lt;br /&gt;
        n=n+cval(old,row+1,col-1)+cval(old,row+1,col)+&lt;br /&gt;
            cval(old,row+1,col+1);&lt;br /&gt;
        // compute next gen cell: dead or alive  &lt;br /&gt;
        if (old[row][col]==1 &amp;amp;&amp;amp; n&amp;lt;2) next[row][col]=0;&lt;br /&gt;
        else if (old[row][col]==1 &amp;amp;&amp;amp; n&amp;gt;3) next[row][col]=0;&lt;br /&gt;
        else if (old[row][col]==1 &amp;amp;&amp;amp; (n==2 || n==3)) next[row][col]=1;          &lt;br /&gt;
        else if (old[row][col]==0 &amp;amp;&amp;amp; n==3) next[row][col]=1;&lt;br /&gt;
        else next[row][col]=0;  &lt;br /&gt;
      }          &lt;br /&gt;
    }           &lt;br /&gt;
  }    &lt;br /&gt;
  &lt;br /&gt;
  // allows to calc neigbour values for cells on borders&lt;br /&gt;
  &lt;br /&gt;
  static int cval(int[][] cells,int r, int c) {&lt;br /&gt;
    if (r&amp;lt;0 || r&amp;gt;=cells.length) return 0;&lt;br /&gt;
    if (c&amp;lt;0 || c&amp;gt;=cells[0].length) return 0;  &lt;br /&gt;
    return cells[r][c];                  &lt;br /&gt;
  }    &lt;br /&gt;
  &lt;br /&gt;
  // give initial position&lt;br /&gt;
  &lt;br /&gt;
  static void initCells(int[][] cells) {&lt;br /&gt;
    initCells2(cells);        &lt;br /&gt;
  }  &lt;br /&gt;
  &lt;br /&gt;
  static void initCells1(int[][] cells) {&lt;br /&gt;
    cells[1][1]=1;&lt;br /&gt;
    cells[3][1]=1;  &lt;br /&gt;
    cells[3][2]=1;&lt;br /&gt;
    cells[4][1]=1;  &lt;br /&gt;
    cells[4][2]=1;  &lt;br /&gt;
    cells[5][1]=1;          &lt;br /&gt;
  }    &lt;br /&gt;
  &lt;br /&gt;
  static void initCells2(int[][] cells) {&lt;br /&gt;
    cells[1][1]=1;&lt;br /&gt;
    cells[1][2]=1;&lt;br /&gt;
    cells[1][3]=1;       &lt;br /&gt;
  }  &lt;br /&gt;
  &lt;br /&gt;
  // just print current cells&lt;br /&gt;
  &lt;br /&gt;
  static void printCells(int[][] cells) {&lt;br /&gt;
    int row,col;&lt;br /&gt;
    for(row=0;row&amp;lt;cells.length;row++) {&lt;br /&gt;
      for(col=0;col&amp;lt;cells[row].length;col++) {&lt;br /&gt;
        if (cells[row][col]==1) {&lt;br /&gt;
          System.out.print(&amp;quot;*&amp;quot;);&lt;br /&gt;
        } else {&lt;br /&gt;
          System.out.print(&amp;quot; &amp;quot;);  &lt;br /&gt;
        }             &lt;br /&gt;
      }&lt;br /&gt;
      System.out.println();      &lt;br /&gt;
    }              &lt;br /&gt;
  }    &lt;br /&gt;
  &lt;br /&gt;
  // just count current cells&lt;br /&gt;
  &lt;br /&gt;
  static int countCells(int[][] cells) {&lt;br /&gt;
    int row,col,count=0;&lt;br /&gt;
    for(row=0;row&amp;lt;cells.length;row++) {&lt;br /&gt;
      for(col=0;col&amp;lt;cells[row].length;col++) {&lt;br /&gt;
        count=count+cells[row][col];        &lt;br /&gt;
      }&lt;br /&gt;
    }  &lt;br /&gt;
    return count;    &lt;br /&gt;
  }  &lt;br /&gt;
}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>Tammet</name></author>
	</entry>
</feed>