android 迷宫游戏设计.7z

/** * */ package edu.cst.aoot.project.maze; import java.util.ArrayList; import java.util.Iterator; import java.util.List; import java.util.Random; import android.graphics.Canvas; import android.graphics.Color; import android.graphics.Paint; import edu.cst.aoot.project.common.Point; /** * @author ZuoJingchao * */ public class MazeMap { private int mCellCount; private Random mRandom = null; private List<Cell> visitedCells = null; public Cell map[][] = null; // width and height in mm private float cellWidth; private float cellHeight; private int rowCount; private int columnCount; private Point firstRowStartPoint; public MazeMap(int rowCount, int columnCount, float cellWidth, float cellHeight) { // TODO Auto-generated constructor stub this.rowCount = rowCount; this.columnCount = columnCount; this.cellWidth = cellWidth; this.cellHeight = cellHeight; mCellCount = rowCount * columnCount; mRandom = new Random(System.currentTimeMillis()); visitedCells = new ArrayList<Cell>(); map = new Cell[rowCount][columnCount]; firstRowStartPoint = new Point(1.0f, 1.0f); } public void prepareGame(){ initMap(); randomMazeMap(); map[0][0].setHasWall(Direction.TOP, false); map[rowCount-1][columnCount -1].setHasWall(Direction.BOTTOM, false); } /** * Initialise the maze map */ private void initMap() { // 4 corner points of the first cell in the first row Point leftUpPoint = firstRowStartPoint; Point leftBottomPoint = new Point(leftUpPoint.getmPosX(), leftUpPoint .getmPosY() + cellHeight); Point rightUpPoint = new Point(leftUpPoint.getmPosX() + cellWidth, leftUpPoint.getmPosY()); Point rightBottomPoint = new Point(leftBottomPoint.getmPosX() + cellWidth, leftBottomPoint.getmPosY()); for (int row = 0; row < rowCount; row++) { // 2 corner points of the first cell in next row Point nextRowLeftUpPoint = leftBottomPoint; Point nextRowRightUpPoint = rightBottomPoint; for (int column = 0; column < columnCount; column++) { Cell cell = new Cell(row, column, leftUpPoint, rightUpPoint, rightBottomPoint, leftBottomPoint, true); // 4 corner points of next cell in the same row leftUpPoint = rightUpPoint; leftBottomPoint = rightBottomPoint; rightUpPoint = new Point(leftUpPoint.getmPosX() + cellWidth, leftUpPoint.getmPosY()); rightBottomPoint = new Point(leftBottomPoint.getmPosX() + cellWidth, leftBottomPoint.getmPosY()); map[row][column] = cell; } // 4 corner points of the first cell in next row leftUpPoint = nextRowLeftUpPoint; rightUpPoint = nextRowRightUpPoint; leftBottomPoint = new Point(leftUpPoint.getmPosX(), leftUpPoint .getmPosY() + cellHeight); rightBottomPoint = new Point( leftBottomPoint.getmPosX() + cellWidth, leftBottomPoint .getmPosY()); } } /** * generate a random Maze Map */ private void randomMazeMap() { // if all the cell have been visited, then return Cell theCell = map[mRandom.nextInt(rowCount)][mRandom .nextInt(columnCount)]; while (visitedCells.size() != mCellCount) { if (!theCell.isVisited()) { theCell.setVisited(true); visitedCells.add(theCell); } // get not visited neighbours int neibCount = 0; Cell[] neighbours = new Cell[4]; // left Cell nextCell; if (theCell.getCol() - 1 >= 0 && !(nextCell = map[theCell.getRow()][theCell.getCol() - 1]) .isVisited()) { neighbours[neibCount++] = nextCell; } // top if (theCell.getRow() - 1 >= 0 && !(nextCell = map[theCell.getRow() - 1][theCell.getCol()]) .isVisited()) { neighbours[neibCount++] = nextCell; } // right if (theCell.getCol() + 1 < columnCount && !(nextCell = map[theCell.getRow()][theCell.getCol() + 1]) .isVisited()) { neighbours[neibCount++] = nextCell; } // bottom if (theCell.getRow() + 1 < rowCount && !(nextCell = map[theCell.getRow() + 1][theCell.getCol()]) .isVisited()) { neighbours[neibCount++] = nextCell; } // if all the neibours have been visited if (neibCount == 0) { theCell = visitedCells .get(mRandom.nextInt(visitedCells.size())); continue; } // random access next cell nextCell = neighbours[mRandom.nextInt(neibCount)]; // delete the wall between two cells // neighbour left if (nextCell.getCol() < theCell.getCol()) { nextCell.setHasWall(Direction.RIGHT, false); theCell.setHasWall(Direction.LEFT, false); } // neighbour top else if (nextCell.getRow() < theCell.getRow()) { nextCell.setHasWall(Direction.BOTTOM, false); theCell.setHasWall(Direction.TOP, false); } // neighbour right else if (nextCell.getCol() > theCell.getCol()) { nextCell.setHasWall(Direction.LEFT, false); theCell.setHasWall(Direction.RIGHT, false); } // neighbour bottom else if (nextCell.getRow() > theCell.getRow()) { nextCell.setHasWall(Direction.TOP, false); theCell.setHasWall(Direction.BOTTOM, false); } // prepare the next loop inviable theCell = nextCell; } } /** * * @param canvas * @param paint */ public void paintMaze(Canvas canvas, Paint paint) { for (int row = 0; row < rowCount; row++) for (int colomn = 0; colomn < columnCount; colomn++) map[row][colomn].drawCell(canvas, paint); } private List<Cell> findPath() { Cell cell; for (int row = 0; row < rowCount; row++) for (int column = 0; column < columnCount; column++) { cell = map[row][column]; cell.setVisited(false); } List<Cell> list = new ArrayList<Cell>(); list.add(map[0][0]); Cell topCell = list.get(list.size() - 1); while (topCell != map[rowCount - 1][columnCount - 1]) { int neibCount = 0; Cell[] neighbours = new Cell[4]; // if the 2 adjacent cells have no walls // left Cell nextCell; if (topCell.getCol() - 1 >= 0 && !(nextCell = map[topCell.getRow()][topCell.getCol() - 1]) .isVisited() && !topCell.hasWall(Direction.LEFT)) { neighbours[neibCount++] = nextCell; } // top if (topCell.getRow() - 1 >= 0 && !(nextCell = map[topCell.getRow() - 1][topCell.getCol()]) .isVisited() && !topCell.hasWall(Direction.TOP)) { neighbours[neibCount++] = nextCell; } // right if (topCell.getCol() + 1 < columnCount && !(nextCell = map[topCell.getRow()][topCell.getCol() + 1]) .isVisited() && !topCell.hasWall(Direction.RIGHT)) { neighbours[neibCount++] = nextCell; } // bottom if (topCell.getRow() + 1 < rowCount && !(nextCell = map[topCell.getRow() + 1][topCell.getCol()]) .isVisited() && !topCell.hasWall(Direction.BOTTOM)) { neighbours[neibCount++] = nextCell; } // if all the neighbours have been visited if (neibCount == 0) { list.remove(list.size() - 1); // loop invariable topCell = list.get(list.size() - 1); continue; } // random access next cell neighbours[0].setVisited(true); list.add(neighbours[0]); // loop invariable topCell = list.get(list.size() - 1); } return list; } /** * paint the path. * * @param canvas * @param paint */ public void paintPath(Canvas canvas, Paint paint) { paint.setColor(Color.RED); List<Cell> list = findPath(); Cell cell1 = null, cell2 = null; Iterator<Cell> i = list.iterator(); if (i.hasNext()) cell1 = i.next(); while (i.hasNext()) { cell2 = i.next(); canvas.drawLine(cell1.getmCenterPoint().getmPosX(), cell1 .getmCenterPoint().getmPosY(), cell2.getmCenterPoint() .getmPosX(), cell2.getmCenterPoint().getmPosY(), paint); cell1 = cell2; } } /** * @param firstRowStartPoint * the startPoint to set */ pu