gpt4 book ai didi

java - 生命游戏(康威游戏)-如何检查小区邻居

转载 作者:行者123 更新时间:2023-12-02 08:04:43 26 4
gpt4 key购买 nike

大家好,我正在尝试计算二维数组中包含的对角线相邻单元格的数量。之后,我将运行使用生命游戏规则的程序,将填充我的新网格。然而,我陷入了indexOutOfBoundsException,我无法弄清楚我做错了什么,我希望有人可以帮助我,这里是代码:

import java.util.Scanner;
import java.io.*;

class LifeGrid
{
private int[][] grid;
private int generation;

public LifeGrid(int x, int y, String filename) throws FileNotFoundException
{
grid = new int[x][y];
int j = 0;

Scanner scanner = new Scanner(new File(filename));

while(scanner.hasNextLine() && j < x)
{
String line = scanner.nextLine();
for(int i=0; i<line.length() && i<y; i++)
{
if(line.charAt(i) == '*')
grid[j][i] = 1;
else
grid[j][i] = 0;
}
j++;
}
scanner.close();
}

public void show()
{
for(int i=0; i<grid.length; i++)
{
for(int j=0; j<grid[i].length; j++)
{
if(grid[i][j] == 1)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
System.out.println("Generation:" + generation);
}

//Getter methods

public int getWidth() { return grid[0].length; }
public int getHeight() { return grid.length; }
public int getGeneration() { return this.generation; }
public int getCell(int x, int y) { return grid[x][y]; }


public static void main(String[] args)throws FileNotFoundException
{
LifeGrid life = new LifeGrid(6, 10, args[0]);
life.run();
}

//Check neighbours

public int neighbours(int x, int y)
{
int neighbours = 0;

if(x >= 1 && y >= 1 && x < getHeight() && y < getWidth())
{
if(grid[x][y++] == 1) {neighbours++;}
if(grid[x][y--] == 1) {neighbours++;}
if(grid[x++][y] == 1) {neighbours++;}
if(grid[x++][y++] == 1) {neighbours++;}
if(grid[x++][y--] == 1) {neighbours++;}
if(grid[x--][y--] == 1) {neighbours++;}
if(grid[x--][y++] == 1) {neighbours++;}
}
else if(x == 0 && y == 0)
{
if(grid[x][y++] == 1) {neighbours++;}
if(grid[x++][y] == 1) {neighbours++;}
if(grid[x++][y++] == 1) {neighbours++;}
}
else if(x == 0 && y >= 1 && y < getWidth() && x < getHeight())
{
if(grid[x][y++] == 1) {neighbours++;}
if(grid[x][y--] == 1) {neighbours++;}
if(grid[x++][y] == 1) {neighbours++;}
if(grid[x++][y++] == 1) {neighbours++;}
if(grid[x++][y--] == 1) {neighbours++;}
}
else if(x >= 1 && x < getHeight() && y == 0 && y < getWidth())
{
if(grid[x][y++] == 1) {neighbours++;}
if(grid[x++][y] == 1) {neighbours++;}
if(grid[x++][y++] == 1) {neighbours++;}
if(grid[x--][y++] == 1) {neighbours++;}
}
else if(x == getHeight() && y >= 1 && y < getWidth())
{
if(grid[x][y++] == 1) {neighbours++;}
if(grid[x][y--] == 1) {neighbours++;}
if(grid[x--][y--] == 1) {neighbours++;}
if(grid[x--][y++] == 1) {neighbours++;}
}
else if(x >=1 && x < getHeight() && y == getWidth())
{
if(grid[x][y--] == 1) {neighbours++;}
if(grid[x++][y] == 1) {neighbours++;}
if(grid[x++][y--] == 1) {neighbours++;}
if(grid[x--][y--] == 1) {neighbours++;}
}
else if(x == 0 && y == getWidth())
{
if(grid[x][y--] == 1) {neighbours++;}
if(grid[x++][y] == 1) {neighbours++;}
if(grid[x++][y--] == 1) {neighbours++;}
}
else if(x == getHeight() && y == 0)
{
if(grid[x--][y] == 1) {neighbours++;}
if(grid[x][++y] == 1) {neighbours++;}
if(grid[x--][y++] == 1) {neighbours++;}
}
else if(x == getHeight() && y == getWidth())
{
if(grid[x][y--] == 1) {neighbours++;}
if(grid[x--][y] == 1) {neighbours++;}
if(grid[x--][y--] == 1) {neighbours++;}
}
return neighbours;
}

public void run()
{
int[][] newGrid = grid;
int[][] swapGrid = grid;;
for(int i=0; i<grid.length; i++)
{
for(int j=0; j<grid[i].length; j++)
{
if(grid[i][j] == 1)
{
if(neighbours(i,j) < 2) generation = 0;
if(neighbours(i,j) > 3) generation = 0;
if(neighbours(i,j) == 2) generation = 1;
}
if(neighbours(i,j) == 3) generation = 1;
if(generation == 1)
{
swapGrid[i][j] = 1;
newGrid = swapGrid;
}
else
{
swapGrid[i][j] = 0;
newGrid = swapGrid;
}
}
}
grid = newGrid;
show();
}
}

异常详细信息:

Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 10 at   
LifeGrid.neighbours(LifeGrid.java:87) at LifeGrid.run(LifeGrid.java:150) at
LifeGrid.main(LifeGrid.java:59)
<小时/>

谢谢你们的立即答复,现在代码可以运行,我可以看到我的输出。然而我注意到 run() 方法中的算法是完全错误的,因为我从生命游戏的规则中得到了不同的输出。规则:

对于“已填充”的空间:

每个有一个或没有邻居的细胞都会死亡,就好像孤独一样。每个有四个或更多邻居的细胞都会死亡,就像人口过剩一样。每个有两个或三个邻居的细胞都能存活下来。对于“空”或“无人居住”的空间:

每个具有三个邻居的单元格都会被填充。

程序使用的文件设计如下:

                                          * * *

因此,遵循我应该作为输出的规则:

                                          *
*
*

这是我的代码:

  import java.util.Scanner;
import java.io.*;

class LifeGrid
{
private int[][] grid;
private int generation;

public LifeGrid(int x, int y, String filename) throws FileNotFoundException
{
grid = new int[x][y];
int j = 0;

Scanner scanner = new Scanner(new File(filename));

while(scanner.hasNextLine() && j < x)
{
String line = scanner.nextLine();

for(int i=0; i<line.length() && i<y; i++)
{
if(line.charAt(i) == '*')
grid[j][i] = 1;
else
grid[j][i] = 0;
}
j++;
}
scanner.close();
}

public void show()
{
for(int i=0; i<grid.length; i++)
{
for(int j=0; j<grid[i].length; j++)
{
if(grid[i][j] == 1)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
System.out.println("Generation:" + generation);
}

//Getter methods

public int getWidth() { return grid[0].length; }
public int getHeight() { return grid.length; }
public int getGeneration() { return this.generation; }
public int getCell(int x, int y) { return grid[x][y]; }


public static void main(String[] args)throws FileNotFoundException
{
LifeGrid life = new LifeGrid(6, 10, args[0]);
life.run();
}

//Check neighbours

public int neighbours(int x, int y)
{
int neighbours = 0;

if(x >= 1 && y >= 1 && x < getHeight() -1 && y < getWidth() -1)
{
if(grid[x][y+1] == 1) {neighbours++;}
if(grid[x][y-1] == 1) {neighbours++;}
if(grid[x+1][y] == 1) {neighbours++;}
if(grid[x+1][y+1] == 1) {neighbours++;}
if(grid[x+1][y-1] == 1) {neighbours++;}
if(grid[x-1][y-1] == 1) {neighbours++;}
if(grid[x-1][y+1] == 1) {neighbours++;}
}
else if(x == 0 && y == 0)
{
if(grid[x][y+1] == 1) {neighbours++;}
if(grid[x+1][y] == 1) {neighbours++;}
if(grid[x+1][y+1] == 1) {neighbours++;}
}
else if(x == 0 && y >= 1 && y < getWidth() -1 && x < getHeight() -1)
{
if(grid[x][y+1] == 1) {neighbours++;}
if(grid[x][y-1] == 1) {neighbours++;}
if(grid[x+1][y] == 1) {neighbours++;}
if(grid[x+1][y+1] == 1) {neighbours++;}
if(grid[x+1][y-1] == 1) {neighbours++;}
}
else if(x >= 1 && x < getHeight() -1 && y == 0 && y < getWidth() -1)
{
if(grid[x][y+1] == 1) {neighbours++;}
if(grid[x+1][y] == 1) {neighbours++;}
if(grid[x+1][y+1] == 1) {neighbours++;}
if(grid[x-1][y+1] == 1) {neighbours++;}
}
else if(x == getHeight() && y >= 1 && y < getWidth() - 1)
{
if(grid[x][y+1] == 1) {neighbours++;}
if(grid[x][y-1] == 1) {neighbours++;}
if(grid[x-1][y-1] == 1) {neighbours++;}
if(grid[x-1][y+1] == 1) {neighbours++;}
}
else if(x >=1 && x < getHeight() - 1 && y == getWidth() )
{
if(grid[x][y-1] == 1) {neighbours++;}
if(grid[x+1][y] == 1) {neighbours++;}
if(grid[x+1][y-1] == 1) {neighbours++;}
if(grid[x-1][y-1] == 1) {neighbours++;}
}
else if(x == 0 && y == getWidth() )
{
if(grid[x][y-1] == 1) {neighbours++;}
if(grid[x+1][y] == 1) {neighbours++;}
if(grid[x+1][y-1] == 1) {neighbours++;}
}
else if(x == getHeight() && y == 0)
{
if(grid[x-1][y] == 1) {neighbours++;}
if(grid[x][y+1] == 1) {neighbours++;}
if(grid[x-1][y+1] == 1) {neighbours++;}
}
else if(x == getHeight() && y == getWidth() )
{
if(grid[x][y-1] == 1) {neighbours++;}
if(grid[x-1][y] == 1) {neighbours++;}
if(grid[x-1][y-1] == 1) {neighbours++;}
}
return neighbours;
}

public void run()
{
int[][] newGrid;
int[][] swap, old, New;
int n;

for(int i=0; i<grid.length; i++)
{
for(int j=0; j<grid[i].length; j++)
{
n = neighbours(i,j);
old = grid;

if(grid[i][j] == 1)
{
if(n < 2) {generation = 0;}
else if(n > 3) {generation = 0;}
else if(n == 2) {generation = 1; }
}
else
{
if(n == 3) {generation = 1;}
else
{generation = 0;}
}

if(generation == 1)
{
New = old;
New[i][j] = 1;
swap = New;
newGrid = swap;
grid = newGrid;

show();

grid = old;
}
else
{
New = old;
New[i][j] = 0;
swap = New;
newGrid = swap;
grid = newGrid;

show();

grid = old;
}

}
}
}
}

提前谢谢您。

最佳答案

我认为它在 neighbours() 方法中。这些 x++ 或 y++ 应该是 x+1 或 y+1(对于 x-- 也是如此)。您不是检查 1 是否大于 x(或 y),而是重复递增它。

关于java - 生命游戏(康威游戏)-如何检查小区邻居,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/8364301/

26 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com