bou*_*472 3 java user-interface
我刚刚完成了Conway的生命游戏的实施.我想知道什么是可视化世代进步的好方法.到目前为止,我有一个简单的打印声明:
System.out.println();
for (int j= 0; j < n; j++){
for (int k= 0; k < n; k++){
System.out.print(board[j][k] + "\t");
}
System.out.print("\n");
}
Run Code Online (Sandbox Code Playgroud)
这可以用于测试,但我真的希望看到一些复杂的结构.我的问题是:我应该如何推进可视化?也许我可以构建某种GUI(虽然我还没有这样做).
以下是我如何构建算法的一般概念:
int i= 0;
while (i < 3){
int[][] temp= board;
for (int j= 0; j < n; j++){
for (int k= 0; k < n; k++){
//Update temp array according to Conway's rules.
}
}
board= temp;
i++;
//Print statements
}
Run Code Online (Sandbox Code Playgroud)
所以,我的确切问题是:如何构建一个GUI?
我很久以前没有触及这个,这是我在java中的实现,这很有趣.
基本上我只是将活细胞画成4x4红色方块.更新方法有一些if可以优化的测试,但我认为性能增益可以忽略不计.在下面的代码中,值为1的tile是活动的,0是死的.
import java.awt.Color;
import java.awt.Dimension;
import java.awt.Graphics;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.beans.Transient;
import java.util.Random;
import javax.swing.JFrame;
import javax.swing.JPanel;
import javax.swing.Timer;
@SuppressWarnings("serial")
public class ConwaysGameOfLife extends JPanel {
private int[][] grid;
private static final Random rnd = new Random();
private int generationCounter;
public ConwaysGameOfLife(int width, int height) {
this.grid = new int[width / 4][height / 4];
setupGrid();
}
private void setupGrid() {
for (int[] row : grid) {
for (int j = 0; j < row.length; j++) {
if (rnd.nextDouble() < 0.92)
continue;
row[j] = rnd.nextInt(2);
}
}
}
public void updateGrid() {
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[i].length; j++) {
applyRule(i, j);
}
}
}
private void applyRule(int i, int j) {
int left = 0, right = 0, up = 0, down = 0;
int dUpperLeft = 0, dUpperRight = 0, dLowerLeft = 0, dLowerRight = 0;
if (j < grid.length - 1) {
right = grid[i][j + 1];
if(i>0)
dUpperRight = grid[i - 1][j + 1];
if (i < grid.length - 1)
dLowerRight = grid[i + 1][j + 1];
}
if (j > 0) {
left = grid[i][j - 1];
if (i > 0)
dUpperLeft = grid[i - 1][j - 1];
if (i< grid.length-1)
dLowerLeft = grid[i + 1][j - 1];
}
if (i > 0)
up = grid[i - 1][j];
if (i < grid.length - 1)
down = grid[i + 1][j];
int sum = left + right + up + down + dUpperLeft + dUpperRight
+ dLowerLeft
+ dLowerRight;
if (grid[i][j] == 1) {
if (sum < 2)
grid[i][j] = 0;
if (sum > 3)
grid[i][j] = 0;
}
else {
if (sum == 3)
grid[i][j] = 1;
}
}
@Override
@Transient
public Dimension getPreferredSize() {
return new Dimension(grid.length * 4, grid[0].length * 4);
}
@Override
protected void paintComponent(Graphics g) {
super.paintComponent(g);
Color gColor = g.getColor();
g.drawString("Generation: " + generationCounter++, 0, 10);
for (int i = 0; i < grid.length; i++) {
for (int j = 0; j < grid[i].length; j++) {
if (grid[i][j] == 1) {
g.setColor(Color.red);
g.fillRect(j * 4, i * 4, 4, 4);
}
}
}
g.setColor(gColor);
}
public static void main(String[] args) {
final ConwaysGameOfLife c = new ConwaysGameOfLife(800, 800);
JFrame frame = new JFrame();
frame.getContentPane().add(c);
frame.pack();
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
frame.setLocationByPlatform(true);
frame.setVisible(true);
new Timer(100, new ActionListener() {
@Override
public void actionPerformed(ActionEvent e) {
c.updateGrid();
c.repaint();
}
}).start();
}
}
Run Code Online (Sandbox Code Playgroud)
管理得到像这样一个漂亮的模式一次运行

| 归档时间: |
|
| 查看次数: |
5431 次 |
| 最近记录: |