我正在编写一个迷宫生成器。我有一个“细胞”类,如下所示:
public class Cell {
public boolean northWall;
public boolean southWall;
public boolean eastWall;
public boolean westWall;
public Cell north;
public Cell south;
public Cell east;
public Cell west;
public boolean visited;
public Cell() {
northWall = true;
southWall = true;
eastWall = true;
westWall = true;
visited = false;
}
public boolean hasUnvisitedNeighbors() {
return ((north != null && !north.Visited)
|| (south != null && !south.Visited)
|| (east != null && !east.Visited) || (west != null && !west.Visited));
}
public Cell removeRandomWall() {
List<Cell> unvisitedNeighbors = new ArrayList<Cell>();
if (north != null && !north.Visited)
unvisitedNeighbors.add(north);
if (south != null && !south.Visited)
unvisitedNeighbors.add(south);
if (west != null && !west.Visited)
unvisitedNeighbors.add(west);
if (east != null && !east.Visited)
unvisitedNeighbors.add(east);
if (unvisitedNeighbors.size() == 0) {
return null;
} else {
Random randGen = new Random();
Cell neighbor = unvisitedNeighbors.get(randGen
.nextInt((unvisitedNeighbors.size())));
if (neighbor == north) {
northWall = false;
north.southWall = false;
return north;
} else if (neighbor == south) {
southWall = false;
south.northWall = false;
return south;
} else if (neighbor == west) {
westWall = false;
west.eastWall = false;
return west;
} else if (neighbor == east) {
eastWall = false;
east.westWall = false;
return east;
}
return null;
}
}
}
我的程序中的迷宫只是一个二维单元格数组。创建数组后,我手动进入并设置对相邻单元格(北、南、东、西)的所有引用。
我要清理的是removeRandomWall()。假设随机选择一个其访问标志设置为 false 的相邻单元格,并移除该单元格和连接它们的相邻单元格中的墙。
所以,它需要考虑所有没有被访问过的相邻单元格,随机选择一个,然后将这个单元格中的墙和相邻的一个设置为false,这样它们之间就有了一条路径。我在上面尝试过,但看起来很笨拙。
谁能帮我吗?