Пример #1
0
 /*This method has the tile at point x and y run its callToBoard method, which will in turn have the board call this method on the tile the current tile connects to, keeping track of the points all the way
  * This method is recursive, and when a tile calls it, it will pass the points it was given on, and if the given x or y postion is out of the legitimate placing bounds, the game recognizes that it has hit the edge of the board and returns the points it has
  */
 public int checkConnection(int x, int y, int i, int points) {
   if (x < 1 || x > 12 || y < 1 || y > 12) {
     return returnPoints(points);
   }
   if ((x == 6 && y == 6) || (x == 7 && y == 6) || (x == 6 && y == 7) || (x == 7 && y == 7)) {
     return 2 * returnPoints(points);
   } else {
     Tile current = tileAt(x, y);
     return current.callToBoard(i, points, x, y);
   }
 }
Пример #2
0
  // get a path from one tile to another
  public ArrayList<Tile> getPath(Tile tileStart, Tile tileEnd) {
    openList.clear();
    closedList.clear();

    targetTile = tileEnd;

    /*if(tileStart == null)
    {
    	System.out.println("tileStart is NULL in getPath()");
    }

    if(tileEnd == null)
    {
    	System.out.println("tileEnd is NULL in getPath()");
    }*/

    // 1. Add starting point to list of open tiles
    openList.add(tileStart);

    // 2. Look for reachable adjacent squares from here
    addAdjacentTilesToOpenList(tileStart);

    // 3. Drop the starting tile and add it to the closed list
    openList.remove(tileStart);
    closedList.add(tileStart);

    // 4a. Get the tile with the lowest F score
    Tile lowestCostTile;

    do {
      lowestCostTile = getLowestCostTile();

      if (lowestCostTile == null) {
        // System.out.println("lowestCostTile is NULL in getPath()");
        return null;
      }
      /*else
      {
      	System.out.println("Tile: " + lowestCostTile.toString());
      }*/

      // 4b. Drop it from the open list and add to the closed list
      openList.remove(lowestCostTile);
      closedList.add(lowestCostTile);

      openList.clear();

      // 5. Check all the adjacent squares
      addAdjacentTilesToOpenList(lowestCostTile);
    } while (!lowestCostTile.equals(targetTile));

    return closedList;
  }
Пример #3
0
 public void moveTo(Position target, Map world) {
   int diff = getPos().find_diff(target);
   setMoving(diff);
   if (world.isMovable(target.getX(), target.getY())) {
     setPos(target);
     tile.setC(null);
     tile = world.tileAt(target);
     tile.setC(this);
   } else {
     setMoving(Creature.no_move);
     setPath(null);
     setMoving(Creature.no_move);
   }
 }
Пример #4
0
  // get the tile with the lowest cost in the open list
  private Tile getLowestCostTile() {
    if (openList.size() == 0) {
      // System.out.println("Open list is size 0 in getLowestCostTile()");
      return null;
    }

    Tile lowestTile = openList.get(0);
    for (Tile t : openList) {
      if (t.getF() < lowestTile.getF()) {
        lowestTile = t;
      }
    }

    return lowestTile;
  }
Пример #5
0
  // add tiles adjacent to a given tile to the open list
  public void addAdjacentTilesToOpenList(Tile theTile) {
    if (theTile == null) {
      return;
    }

    int row = theTile.getRow();
    int col = theTile.getColumn();

    // Since we're working with an isometric grid, the north and south adjacent tiles are going to
    // have greater
    // row values in order to preserve the projection angle.
    addTile(
        tiles.get((row - 2) + "-" + col),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_ORTHOGONAL); // north
    addTile(
        tiles.get((row - 1) + "-" + (col - 1)),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_DIAGONAL); // north-west
    addTile(
        tiles.get(row + "-" + (col - 1)),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_ORTHOGONAL); // west
    addTile(
        tiles.get((row + 1) + "-" + (col - 1)),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_DIAGONAL); // south-west
    addTile(
        tiles.get((row + 2) + "-" + col),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_ORTHOGONAL); // south
    addTile(
        tiles.get((row + 1) + "-" + (col + 1)),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_DIAGONAL); // south-east
    addTile(
        tiles.get(row + "-" + (col + 1)),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_ORTHOGONAL); // east
    addTile(
        tiles.get((row - 1) + "-" + (col + 1)),
        theTile,
        GameConstants.CONST_MOVEMENT_COST_DIAGONAL); // north-east
  }
Пример #6
0
  // add a tile to the open list
  private void addTile(Tile theTile, Tile parentTile, int gScore) {
    if (theTile != null && theTile.getType() != Tile.TILE_NOGO && !closedList.contains(theTile)) {
      if (!openList.contains(theTile)) // check to see if the open list already contains the tile
      {
        theTile.setG(parentTile.getG() + gScore); // set the orthogonal/diagonal movement cost

        // set the distance from this tile to the target if all movement were done orthogonally
        theTile.setH(
            Math.abs(theTile.getY() - targetTile.getY())
                + Math.abs(theTile.getX() - targetTile.getX()));

        // set the parent tile for this tile and add it to the open list
        theTile.setParent(parentTile);
        openList.add(theTile);
      } else {
        // open list already contains tile, so check G values
        int index = openList.indexOf(theTile);
        Tile existingTile = openList.get(index);
        if ((gScore + parentTile.getG()) < existingTile.getG()) {
          // change the tile to point at the last tile in the closed list
          existingTile.setParent(closedList.get(closedList.size() - 1));

          openList.set(index, existingTile);
        }
      }
    }
  }
Пример #7
0
  private void setTileIsLegal(int x, int y, Tile t) {
    if ((x == 1 || x == 12 || y == 1 || y == 12)) {

      if (y == 1 && x > 1 && x < 12) {
        if (t.getLegal().charAt(0) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(1) == '0' || eastWallCheck())
            && (t.getLegal().charAt(2) == '0' || southWallCheck())
            && (t.getLegal().charAt(3) == '0' || westWallCheck())
            && (t.getLegal().charAt(6) == '0' || southEastCheck())
            && (t.getLegal().charAt(7) == '0' || southWestCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }

      if (x == 12 && y > 1 && y < 12) {
        if (t.getLegal().charAt(1) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(0) == '0' || northWallCheck())
            && (t.getLegal().charAt(2) == '0' || southWallCheck())
            && (t.getLegal().charAt(3) == '0' || westWallCheck())
            && (t.getLegal().charAt(4) == '0' || northWestCheck())
            && (t.getLegal().charAt(7) == '0' || southWestCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }

      if (y == 12 && x > 1 && x < 12) {
        if (t.getLegal().charAt(2) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(0) == '0' || northWallCheck())
            && (t.getLegal().charAt(1) == '0' || eastWallCheck())
            && (t.getLegal().charAt(3) == '0' || westWallCheck())
            && (t.getLegal().charAt(4) == '0' || northWestCheck())
            && (t.getLegal().charAt(5) == '0' || northEastCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }

      if (x == 1 && y > 1 && y < 12) {
        if (t.getLegal().charAt(3) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(0) == '0' || northWallCheck())
            && (t.getLegal().charAt(1) == '0' || eastWallCheck())
            && (t.getLegal().charAt(2) == '0' || southWallCheck())
            && (t.getLegal().charAt(5) == '0' || northEastCheck())
            && (t.getLegal().charAt(6) == '0' || southEastCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }

      if (x == 1 && y == 1) {
        if (t.getLegal().charAt(4) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(0) == '0' || northWallCheck())
            && (t.getLegal().charAt(1) == '0' || eastWallCheck())
            && (t.getLegal().charAt(2) == '0' || southWallCheck())
            && (t.getLegal().charAt(3) == '0' || westWallCheck())
            && (t.getLegal().charAt(5) == '0' || northEastCheck())
            && (t.getLegal().charAt(6) == '0' || southEastCheck())
            && (t.getLegal().charAt(7) == '0' || southWestCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }

      if (x == 12 && y == 1) {
        if (t.getLegal().charAt(5) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(0) == '0' || northWallCheck())
            && (t.getLegal().charAt(1) == '0' || eastWallCheck())
            && (t.getLegal().charAt(2) == '0' || southWallCheck())
            && (t.getLegal().charAt(3) == '0' || westWallCheck())
            && (t.getLegal().charAt(4) == '0' || northWestCheck())
            && (t.getLegal().charAt(6) == '0' || southEastCheck())
            && (t.getLegal().charAt(7) == '0' || southWestCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }

      if (x == 12 && y == 12) {
        if (t.getLegal().charAt(6) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(0) == '0' || northWallCheck())
            && (t.getLegal().charAt(1) == '0' || eastWallCheck())
            && (t.getLegal().charAt(2) == '0' || southWallCheck())
            && (t.getLegal().charAt(3) == '0' || westWallCheck())
            && (t.getLegal().charAt(4) == '0' || northWestCheck())
            && (t.getLegal().charAt(5) == '0' || northEastCheck())
            && (t.getLegal().charAt(7) == '0' || southWestCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }

      if (x == 1 && y == 12) {
        if (t.getLegal().charAt(7) == '1') {
          _tileIsLegal = true;
        } else if ((middleCheck())
            && (t.getLegal().charAt(0) == '0' || northWallCheck())
            && (t.getLegal().charAt(1) == '0' || eastWallCheck())
            && (t.getLegal().charAt(2) == '0' || southWallCheck())
            && (t.getLegal().charAt(3) == '0' || westWallCheck())
            && (t.getLegal().charAt(4) == '0' || northWestCheck())
            && (t.getLegal().charAt(5) == '0' || northEastCheck())
            && (t.getLegal().charAt(6) == '0' || southEastCheck())) {
          _tileIsLegal = true;
        } else {
          _tileIsLegal = false;
        }
      }
    } else {
      _tileIsLegal = true;
    }
  }