生命游戏

package qinglin.learn.arithmetic;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class LifeGame
{
private boolean[][] map;

private boolean[][] newmap;

public LifeGame(int maxRow, int maxColumn)
{
map = new boolean[maxRow][maxColumn];
newmap = new boolean[maxRow][maxColumn];
}

public void setCell(int x, int y)
{
map[x][y] = true;
}

public void next()
{
for (int row = 0; row < map.length; row++)
{
for (int col = 0; col < map[0].length; col++)
{
switch (neighbors(row, col))
{
case 0:
case 1:
case 4:
case 5:
case 6:
case 7:
case 8:
newmap[row][col] = false;
break;
case 2:
newmap[row][col] = map[row][col];
break;
case 3:
newmap[row][col] = true;
break;
}
}
}
copyMap();
}

public void outputMap() throws IOException
{
System.out.println("\n\nGame of life cell status");
for (int row = 0; row < map.length; row++)
{
System.out.print("\n ");
for (int col = 0; col < map[0].length; col++)
if (map[row][col] == true)
System.out.print('#');
else System.out.print('-');
}
}

private void copyMap()
{
for (int row = 0; row < map.length; row++)
for (int col = 0; col < map[0].length; col++)
map[row][col] = newmap[row][col];
}

private int neighbors(int row, int col)
{
int count = 0;

for (int r = row - 1; r <= row + 1; r++)
for (int c = col - 1; c <= col + 1; c++)
{
if (r < 0 || r >= map.length || c < 0 || c >= map[0].length)
continue;
if (map[r][c] == true)
count++;
}

if (map[row][col] == true)
count--;

return count;
}

public static void main(String[] args) throws NumberFormatException,
IOException
{
BufferedReader bufReader = new BufferedReader(new InputStreamReader(
System.in));

LifeGame game = new LifeGame(10, 25);

System.out.println("Game of life Program");
System.out.println("Enter x, y where x, y is living cell");
System.out.println("0 <= x < 10, 0 <= y < 25");
System.out.println("Terminate with x, y = -1, -1");

while (true)
{
String[] strs = bufReader.readLine().split(" ");
int row = Integer.parseInt(strs[0]);
int col = Integer.parseInt(strs[1]);

if (0 <= row && row < 10 && 0 <= col && row < 25)
game.setCell(row, col);
else if (row == -1 || col == -1)
{
break;
}
else
{
System.out.print("(x, y) exceeds map ranage!");
}
}

while (true)
{
game.outputMap();
game.next();

System.out.print("\nContinue next Generation ? ");

String ans = bufReader.readLine().toUpperCase();

if (!ans.equals("Y"))
break;
}
}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值