package solution; import battleship.battleship; import battleship.cellstate; import java.awt.point; import java.util.arraylist;

Transcription

1 package solution; import battleship.battleship; import battleship.cellstate; import java.awt.point; import java.util.arraylist; Salah Abuzaid public class SampleBot { public int gamesize; public int[] shipsizes; public BattleShip battleship; public ArrayList<Point> spots_hit; public CellState[][] current_board; public int[][] pmap; * Constructor keeps a copy of the BattleShip instance b previously created battleship instance - should be a new game public SampleBot(BattleShip b) { this.battleship = b; this.gamesize = b.boardsize; this.pmap = new int[this.gamesize][this.gamesize]; this.spots_hit = new ArrayList(); this.current_board = new CellState[this.gameSize][this.gameSize]; this.shipsizes = this.battleship.shipsizes(); for (int i = 0; i < this.gamesize; i++){ for (int j = 0; j < this.gamesize; j++){ this.current_board[i][j] = CellState.Empty; this.pmap[i][j] = 0; prob_gather(); private void prob_gather(){ this.pmap[j][i] = 0; for (int i = 0; i < this.shipsizes.length; i ++){ findprobability(shipsizes[i]); private void findprobability(int shipsize){ int start = 0; int end = start + shipsize - 1; do {

2 boolean next = false; if (current_board[j][i]!= CellState.Empty){ next = true; if(next == false){ pmap[j][i] ++; start ++; end ++; while (end < gamesize); start = 0; end = start + shipsize - 1; while (end < gamesize){ boolean next = false; if (current_board[i][j]!= CellState.Empty){ next = true; if(!next){ pmap[i][j] ++; start++; end++; start = 0; end = start + shipsize - 1; private Point search_best_shotpoint(){ int best = 0; Point highestpoint = new Point(1,9); if (pmap[j][i] > best){ best = pmap[j][i]; highestpoint.x = j; highestpoint.y = i; return highestpoint; private int search_best_shot(){ int best = 0; if (pmap[j][i] > best){ best = pmap[j][i];

3 return best; private void surrounding_hit_area(int i, int j){ if (this.current_board[j][i] == CellState.Hit){ if(i+1 < gamesize) if (this.current_board[j][i+1] == CellState.Empty){ shoot(new Point(j, i+1)); if(i-1 >= 0) if (this.current_board[j][i-1] == CellState.Empty){ shoot(new Point(j, i-1)); if(j+1 < gamesize) if (this.current_board[j+1][i] == CellState.Empty){ shoot(new Point(j+1, i)); if(j-1 >= 0) if (this.current_board[j-1][i] == CellState.Empty){ shoot(new Point(j-1, i)); public void shoot(point bestpoint){ boolean hit = battleship.shoot(bestpoint); spots_hit.add(bestpoint); current_board[bestpoint.x][bestpoint.y] = CellState.Hit; else { current_board[bestpoint.x][bestpoint.y] = CellState.Miss; public boolean finddirection(point firstshot, char axis, char add_subtract, int incr_decr, int totalsunken){ //new point Point shot = new Point(firstShot); if (axis == 'x'){ if (add_subtract == '-'){ shot.x -= incr_decr; else { shot.x += incr_decr; else{ if (add_subtract == '-'){ shot.y -= incr_decr; else { shot.y += incr_decr; if(battleship.numberofshipssunk()!= totalsunken){ return true; else if ( shot.x < gamesize && shot.y < gamesize && shot.x >= 0 && shot.y >= 0 && current_board[shot.x][shot.y] == CellState.Empty){ boolean hit = battleship.shoot(shot); current_board[shot.x][shot.y] = CellState.Hit;

4 spots_hit.add(shot); if (battleship.numberofshipssunk() == totalsunken){ return finddirection(firstshot, axis, add_subtract, incr_decr+1, totalsunken); else { return true; else{ current_board[shot.x][shot.y] = CellState.Miss; if (add_subtract == '+'){ return finddirection(firstshot, axis, '-', 1, totalsunken); else { return false; else { if (spots_hit.contains(shot)){ return finddirection(firstshot, axis, add_subtract, incr_decr+1, totalsunken); else { if (add_subtract == '+') { return finddirection(firstshot, axis, '-', 1, totalsunken); else { return false; private void continueshooting(point bestpoint, int totalsunken){ boolean hit = battleship.shoot(bestpoint); spots_hit.add(bestpoint); current_board[bestpoint.x][bestpoint.y] = CellState.Hit; while(battleship.numberofshipssunk() == totalsunken){ if(finddirection(bestpoint, 'x', '+', 1, totalsunken) == false){ finddirection(bestpoint, 'y', '+', 1, totalsunken); else { current_board[bestpoint.x][bestpoint.y] = CellState.Miss; public void fireshot() { prob_gather(); int totalsunken = battleship.numberofshipssunk(); int bestshot = search_best_shot(); Point bestpoint = search_best_shotpoint(); if (bestshot == 0){ surrounding_hit_area(i, j); else {

5 continueshooting(bestpoint, totalsunken); *****************************Driver Class******************************* package solution; import battleship.battleship; * Lab#6 * Salah Abuzaid public class COMP10152_Lab6 { static final int NUMBEROFGAMES = 10000; public static void startingsolution() { int totalshots = 0; System.out.println(BattleShip.version()); for (int game = 0; game < NUMBEROFGAMES; game++) { BattleShip battleship = new BattleShip(); SampleBot simulation = new SampleBot(battleShip); while (!battleship.allsunk()) { simulation.fireshot(); int gameshots = battleship.totalshotstaken(); totalshots += gameshots; System.out.printf("SampleBot - The Average # of Shots required in %d games to sink all Ships = %.2f\n", NUMBEROFGAMES, (double) totalshots / NUMBEROFGAMES); public static void main(string[] args) { startingsolution();