详细代码见我的相应github仓库:
https://github.com/29DCH/Mine-Sweeper
欢迎fork源码到你自己的仓库下面。
效果图:
java awt以及swing实现的扫雷游戏,实现了基本逻辑.主要用到了floodfill(漫水填充)算法和knuth-shuffling-algorithm(Fisher–Yates也被称作高纳德(Knuth)随机置乱算法,随机洗牌算法)
代码如下:
AlgoFrame.java
package Test;
import java.awt.*;
import javax.swing.*;
public class AlgoFrame extends JFrame{
private int canvasWidth;
private int canvasHeight;
public AlgoFrame(String title, int canvasWidth, int canvasHeight){
super(title);
this.canvasWidth = canvasWidth;
this.canvasHeight = canvasHeight;
AlgoCanvas canvas = new AlgoCanvas();
setContentPane(canvas);
pack();
setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
setResizable(false);
setVisible(true);
}
public AlgoFrame(String title){
this(title, 1024, 768);
}
public int getCanvasWidth(){return canvasWidth;}
public int getCanvasHeight(){return canvasHeight;}
// data
private MineSweeperData data;
public void render(MineSweeperData data){
this.data = data;
repaint();
}
private class AlgoCanvas extends JPanel{
public AlgoCanvas(){
// 双缓存
super(true);
}
@Override
public void paintComponent(Graphics g) {
super.paintComponent(g);
Graphics2D g2d = (Graphics2D)g;
// 抗锯齿
RenderingHints hints = new RenderingHints(
RenderingHints.KEY_ANTIALIASING,
RenderingHints.VALUE_ANTIALIAS_ON);
hints.put(RenderingHints.KEY_RENDERING, RenderingHints.VALUE_RENDER_QUALITY);
g2d.addRenderingHints(hints);
// 具体绘制
int w = canvasWidth/data.M();
int h = canvasHeight/data.N();
for(int i = 0 ; i < data.N() ; i ++)
for(int j = 0 ; j < data.M() ; j ++){
if(data.open[i][j]){
if(data.isMine(i, j))
AlgoVisHelper.putImage(g2d, j*w, i*h, MineSweeperData.mineImageURL);
else
AlgoVisHelper.putImage(g2d, j*w, i*h, MineSweeperData.numberImageURL(data.getNumber(i, j)));
}
else{
if(data.flags[i][j])
AlgoVisHelper.putImage(g2d, j*w, i*h, MineSweeperData.flagImageURL);
else
AlgoVisHelper.putImage(g2d, j*w, i*h, MineSweeperData.blockImageURL);
}
}
}
@Override
public Dimension getPreferredSize(){
return new Dimension(canvasWidth, canvasHeight);
}
}
}
AlgoVisHelper.java
package Test;
import javax.swing.*;
import java.awt.*;
import java.awt.geom.Ellipse2D;
import java.awt.geom.Rectangle2D;
import java.lang.InterruptedException;
public class AlgoVisHelper {
private AlgoVisHelper(){}
public static final Color Red = new Color(0xF44336);
public static final Color Pink = new Color(0xE91E63);
public static final Color Purple = new Color(0x9C27B0);
public static final Color DeepPurple = new Color(0x673AB7);
public static final Color Indigo = new Color(0x3F51B5);
public static final Color Blue = new Color(0x2196F3);
public static final Color LightBlue = new Color(0x03A9F4);
public static final Color Cyan = new Color(0x00BCD4);
public static final Color Teal = new Color(0x009688);
public static final Color Green = new Color(0x4CAF50);
public static final Color LightGreen = new Color(0x8BC34A);
public static final Color Lime = new Color(0xCDDC39);
public static final Color Yellow = new Color(0xFFEB3B);
public static final Color Amber = new Color(0xFFC107);
public static final Color Orange = new Color(0xFF9800);
public static final Color DeepOrange = new Color(0xFF5722);
public static final Color Brown = new Color(0x795548);
public static final Color Grey = new Color(0x9E9E9E);
public static final Color BlueGrey = new Color(0x607D8B);
public static final Color Black = new Color(0x000000);
public static final Color White = new Color(0xFFFFFF);
public static void strokeCircle(Graphics2D g, int x, int y, int r){
Ellipse2D circle = new Ellipse2D.Double(x-r, y-r, 2*r, 2*r);
g.draw(circle);
}
public static void fillCircle(Graphics2D g, int x, int y, int r){
Ellipse2D circle = new Ellipse2D.Double(x-r, y-r, 2*r, 2*r);
g.fill(circle);
}
public static void strokeRectangle(Graphics2D g, int x, int y, int w, int h){
Rectangle2D rectangle = new Rectangle2D.Double(x, y, w, h);
g.draw(rectangle);
}
public static void fillRectangle(Graphics2D g, int x, int y, int w, int h){
Rectangle2D rectangle = new Rectangle2D.Double(x, y, w, h);
g.fill(rectangle);
}
public static void setColor(Graphics2D g, Color color){
g.setColor(color);
}
public static void setStrokeWidth(Graphics2D g, int w){
int strokeWidth = w;
g.setStroke(new BasicStroke(strokeWidth, BasicStroke.CAP_ROUND, BasicStroke.JOIN_ROUND));
}
public static void pause(int t) {
try {
Thread.sleep(t);
}
catch (InterruptedException e) {
System.out.println("Error sleeping");
}
}
public static void putImage(Graphics2D g, int x, int y, String imageURL){
ImageIcon icon = new ImageIcon(imageURL);
Image image = icon.getImage();
g.drawImage(image, x, y, null);
}
}
AlgoVisualizer.java
package Test;
import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
public class AlgoVisualizer {
private static int DELAY = 5;
private static int blockSide = 32;
private MineSweeperData data;
private AlgoFrame frame;
private static final int d[][] = {{-1,0},{0,1},{1,0},{0,-1}};
public AlgoVisualizer(int N, int M, int mineNumber){
data = new MineSweeperData(N, M, mineNumber);
int sceneWidth = M * blockSide;
int sceneHeight = N * blockSide;
EventQueue.invokeLater(() -> {
frame = new AlgoFrame("Mine Sweeper", sceneWidth,sceneHeight);
frame.addMouseListener(new AlgoMouseListener());
new Thread(() -> {
run();
}).start();
});
}
public void run(){
this.setData(false, -1, -1);
}
private void setData(boolean isLeftClicked, int x, int y){
if(isLeftClicked){
if(data.inArea(x, y))
if(data.isMine(x, y)){
// Game Over
data.open[x][y] = true;
}
else
data.open(x, y);
}
else{
if(data.inArea(x, y))
// data.flags[x][y] = true;
data.flags[x][y] = !data.flags[x][y];
}
frame.render(data);
AlgoVisHelper.pause(DELAY);
}
public void addAlgoMouseListener(){
frame.addMouseListener(new AlgoMouseListener());
}
private class AlgoMouseListener extends MouseAdapter{
@Override
public void mouseReleased(MouseEvent event){
event.translatePoint(
-(int)(frame.getBounds().width - frame.getCanvasWidth()),
-(int)(frame.getBounds().height - frame.getCanvasHeight())
);
Point pos = event.getPoint();
int w = frame.getCanvasWidth() / data.M();
int h = frame.getCanvasHeight() / data.N();
int x = pos.y / h;
int y = pos.x / w;
// System.out.println(x + " , " + y);
if(SwingUtilities.isLeftMouseButton(event))
setData(true, x, y);
else if(SwingUtilities.isRightMouseButton(event))
setData(false, x, y);
}
}
public static void main(String[] args) {
int N = 20;
int M = 30;
int mineNumber = 20;
AlgoVisualizer vis = new AlgoVisualizer(N, M, mineNumber);
}
}
MineSweeperData.java
package Test;
public class MineSweeperData {
public static final String blockImageURL = "resources/block.png";
public static final String flagImageURL = "resources/flag.png";
public static final String mineImageURL = "resources/mine.png";
public static String numberImageURL(int num) {
if (num < 0 || num >= 8)
throw new IllegalArgumentException("No such a number image!");
return "resources/" + num + ".png";
}
private int N, M;
private boolean[][] mines;
private int[][] numbers;
public boolean[][] open;
public boolean[][] flags;
public MineSweeperData(int N, int M, int mineNumber) {
if (N <= 0 || M <= 0)
throw new IllegalArgumentException("Mine sweeper size is invalid!");
if (mineNumber < 0 || mineNumber > N * M)
throw new IllegalArgumentException("Mine number is larger than the size of mine sweeper board!");
this.N = N;
this.M = M;
mines = new boolean[N][M];
numbers = new int[N][M];
open = new boolean[N][M];
flags = new boolean[N][M];
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++) {
mines[i][j] = false;
numbers[i][j] = 0;
open[i][j] = false;
flags[i][j] = false;
}
generateMines(mineNumber);
calculateNumbers();
}
public int N() {
return N;
}
public int M() {
return M;
}
public boolean isMine(int x, int y) {
if (!inArea(x, y))
throw new IllegalArgumentException("Out of index in isMine function!");
return mines[x][y];
}
public int getNumber(int x, int y) {
if (!inArea(x, y))
throw new IllegalArgumentException("Out of index in getNumber function!");
return numbers[x][y];
}
public boolean inArea(int x, int y) {
return x >= 0 && x < N && y >= 0 && y < M;
}
private void generateMines(int mineNumber) {
for (int i = 0; i < mineNumber; i++) {
int x = i / M;
int y = i % M;
mines[x][y] = true;
}
for (int i = N * M - 1; i >= 0; i--) {
int iX = i / M;
int iY = i % M;
int randNumber = (int) (Math.random() * (i + 1));
int randX = randNumber / M;
int randY = randNumber % M;
swap(iX, iY, randX, randY);
}
}
private void swap(int x1, int y1, int x2, int y2) {
boolean t = mines[x1][y1];
mines[x1][y1] = mines[x2][y2];
mines[x2][y2] = t;
}
private void calculateNumbers() {
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++) {
if (mines[i][j])
numbers[i][j] = -1;
numbers[i][j] = 0;
for (int ii = i - 1; ii <= i + 1; ii++)
for (int jj = j - 1; jj <= j + 1; jj++)
if (inArea(ii, jj) && isMine(ii, jj))
numbers[i][j]++;
}
return;
}
public void open(int x, int y) {
if (!inArea(x, y))
throw new IllegalArgumentException("Out of index in open function!");
if (isMine(x, y))
throw new IllegalArgumentException("Cannot open an mine block in open function.");
open[x][y] = true;
if (getNumber(x, y) == 0) {
for (int i = x - 1; i <= x + 1; i++)
for (int j = y - 1; j <= y + 1; j++)
if (inArea(i, j) && !open[i][j] && !isMine(i, j))
open(i, j);
}
}
}