/* * Copyright (c) 2003-2008 jMonkeyEngine * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are * met: * * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * * Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * * Neither the name of 'jMonkeyEngine' nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /* * Author: Chris Bishop */ package internals; import java.awt.Point; import java.util.ArrayList; import java.util.Random; public class MineField { public static final int BEGINNER = 0; public static final int INTERMEDIATE = 1; public static final int EXPERT = 2; private int numberOfMines; private int width, height; //path for uncovering adjacent cells private final Point up = new Point(0, -1); private final Point down = new Point(0, 1); private final Point left = new Point(-1, 0); private final Point right = new Point(1, 0); private final Point[] path = new Point[] {down, left, up, up, right, right, down, down}; private final Point[] path2 = new Point[] {down, left, up, right}; //mine locations as well as labels private Cell[][] field; public MineField() { } public MineField(int difficulty) { switch(difficulty) { case BEGINNER: numberOfMines = 10; width = 9; height = 9; break; case INTERMEDIATE: numberOfMines = 40; width = 16; height = 16; break; case EXPERT: numberOfMines = 99; width = 30; height = 16; break; } field = new Cell[height + 2][width + 2]; populateBoard(); } private void populateBoard() { Random generator = new Random(); //initiate field for(int row = 0; row < height + 2; row++) { for(int column = 0; column < width + 2; column++) { field[row][column] = new Cell(); } } //place mines randomly for(int amount = 0; amount < numberOfMines; amount++) { int x = generator.nextInt(width) + 1; int y = generator.nextInt(height) + 1; System.out.println(x + " " + y); if(!field[y][x].hasMine()) field[y][x].placeMine(); else amount--; } constructLabels(); createBorders(); } private void constructLabels() { for(int row = 1; row < height + 1; row++) { for(int column = 1; column < width + 1; column++) { if(field[row][column].hasMine()) { for(int i = -1; i < 2; i++) { for(int j = -1; j < 2; j++) field[row + i][column + j].incrementLabel(); } } } } } private void createBorders() { //top and bottom for(int column = 0; column < width + 2; column++) { field[0][column].uncover(); field[height+1][column].uncover(); } //sides for(int row = 0; row < height + 2; row++) { field[row][0].uncover(); field[row][width+1].uncover(); } } private int countMines(Point start) { int count = 0; for(int row = -1; row < 2; row++) { for(int column = -1; column < 2; column++) { if(field[start.y + row][start.x + column].hasMine()) count++; } } return count; } //recursive method to reveal all pertinent cells surrounding given cell private void revealCells(Point loc) { if(!field[loc.y][loc.x].isCovered()) return; field[loc.y][loc.x].uncover(); if(countMines(loc) == 0) { for(int row = -1; row < 2; row++) { for(int column = -1; column < 2; column++) { revealCells(new Point(loc.x + column, loc.y + row)); } } } } public void dig(Point here) { if(field[here.y][here.x].hasMine()) System.out.println("Boom!!!"); else revealCells(here); } public ArrayList getMines() { ArrayList mines = new ArrayList(); for(int row = 0; row < height + 2; row++) { for(int column = 0; column < width + 2; column++) { if(field[row][column].hasMine()) mines.add(new Point(column, row)); } } return mines; } public Cell[][] getCells() { return field; } public int getHeight() { return height; } public int getWidth() { return width; } public void reset() { populateBoard(); } public void drawField() { for(int row = 1; row < height + 1; row++) { for(int column = 1; column < width + 1; column++) { if(field[row][column].isCovered()) { if(field[row][column].hasMine()) System.out.print("*"); else System.out.print("-"); } else if(!field[row][column].isCovered()) { if(field[row][column].hasMine()) System.out.print("*"); else System.out.print(field[row][column].getLabel()); } } System.out.println(""); } } }