Java实现可视化走迷宫小游戏的示例代码

import java.io.BufferedInputStream; import java.io.File; import java.io.FileInputStream; import java.io.IOException; import java.util.Scanner; public class MazeData { public static final char ROAD = ' '; public static final char WALL = '#'; private int N, M;   // 高，宽（行，列） private char[][] maze; private int entranceX, entranceY;   // 入口 private int exitX, exitY;   // 出口 public boolean[][] visited; // 记录寻路过程某位置是否被访问过 public boolean[][] path;    // 存储迷宫的解 public boolean showPath;    // 是否打印系统提示的开关 public Position player; // 玩家所处位置 public MazeData(String filename){ if (filename == null) throw new IllegalArgumentException("Filename can not be null!"); Scanner scanner = null; try { File file = new File(filename); if (!file.exists()) throw new IllegalArgumentException("File " + filename + " doesn't exist"); FileInputStream fis = new FileInputStream(file); scanner = new Scanner(new BufferedInputStream(fis), "UTF-8"); // 读取第一行 String nmline = scanner.nextLine(); String[] nm = nmline.trim().split("\\s+");    // 正则 匹配任意空白字符 N = Integer.parseInt(nm[0]); M = Integer.parseInt(nm[1]); maze = new char[N][M]; visited = new boolean[N][M]; path = new boolean[N][M]; showPath = false; // 读取后续的N行 for (int i = 0; i = 0 && x = 0 && y 

public class Position { private int x, y; public Position(int x, int y, Position prev){ this.x = x; this.y = y; } public Position(int x, int y){ this(x, y, null); } public int getX(){ return x; } public int getY(){ return y; } public void setX(int x){ this.x = x; } public void setY(int y){ this.y = y; } }

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;} private MazeData data; public void render(MazeData 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 

import java.awt.*; import java.awt.event.KeyAdapter; import java.awt.event.KeyEvent; public class AlgoVisualizer { private static int DELAY = 10; private static int blockSide = 8; private MazeData data; private AlgoFrame frame; private static final int d[][] = {{-1,0},{0,1},{1,0},{0,-1}}; // 四个方向移动 public AlgoVisualizer(String mazeFile){ // 初始化数据 data = new MazeData(mazeFile); int sceneHeight = data.N() * blockSide; int sceneWidth = data.M() * blockSide; // 初始化视图 EventQueue.invokeLater(() -> { frame = new AlgoFrame("Maze Solver Visualization", sceneWidth, sceneHeight); frame.addKeyListener(new AlgoKeyListener()); new Thread(() -> { run(); }).start(); }); } public void run(){ setData(-1, -1, false); data.player = new Position(data.getEntranceX(), data.getEntranceY()); // 递归实现 if(!autoGo(data.getEntranceX(), data.getEntranceY())) System.out.println("The maze has NO solution!"); System.out.println("初始化已完成"); while (true){ frame.render(data); AlgoVisHelper.pause(DELAY); setData(-1, -1, false); if (data.player.getX() == data.getExitX() && data.player.getY() == data.getExitY()){ System.out.println("游戏结束"); frame.render(data); AlgoVisHelper.pause(DELAY); break; } } setData(-1, -1, false); } // 返回值：求解是否成功 private boolean autoGo(int x, int y){ if(!data.inArea(x,y)) throw new IllegalArgumentException("x,y are out of index in go function!"); data.visited[x][y] = true; setData(x, y, true); if (x == data.getExitX() && y == data.getExitY()) return true; for (int i = 0; i <4; i ++){ int newX = x + d[i][0]; int newY = y + d[i][1]; if (data.inArea(newX, newY) && data.getMaze(newX, newY) == MazeData.ROAD && !data.visited[newX][newY]){ if (autoGo(newX, newY)) return true; } } setData(x, y, false); return false; } private void setData(int x, int y, boolean isPath){ if (data.inArea(x, y)) data.path[x][y] = isPath; } private class AlgoKeyListener extends KeyAdapter{ @Override public void keyPressed(KeyEvent event){ if (event.getKeyCode() == KeyEvent.VK_LEFT){ System.out.println("go left"); oneStep(data.player.getX(), data.player.getY(), 3); } else if (event.getKeyCode() == KeyEvent.VK_DOWN){ System.out.println("go down"); oneStep(data.player.getX(), data.player.getY(), 2); } else if (event.getKeyCode() == KeyEvent.VK_RIGHT){ System.out.println("go right"); oneStep(data.player.getX(), data.player.getY(), 1); } else if (event.getKeyCode() == KeyEvent.VK_UP){ System.out.println("go up"); oneStep(data.player.getX(), data.player.getY(), 0); } else if (event.getKeyChar() == ' '){ System.out.println("显示提示"); data.showPath = !data.showPath; } } } private void oneStep(int x, int y, int direction){ int newX = x + d[direction][0]; int newY = y + d[direction][1]; if (data.inArea(newX, newY) && data.getMaze(newX, newY) == MazeData.ROAD){ data.player.setX(newX); data.player.setY(newY); } } public static void main(String[] args) { String mazefile = "maze_101_101.txt"; AlgoVisualizer vis = new AlgoVisualizer(mazefile); } }