Compare commits

...

2 Commits

Author SHA1 Message Date
Your Average Code
a3de94a4f8 SnakeBot enemies 2024-01-25 21:27:20 +01:00
Your Average Code
59514963eb simplify RumbleBot 2024-01-25 21:26:53 +01:00
3 changed files with 21 additions and 27 deletions

View File

@ -46,6 +46,7 @@ public abstract class Bot implements Runnable {
protected void print(View view) { protected void print(View view) {
view.print(); view.print();
System.out.println();
} }
// Diese Methode ermittelt den nächsten Zug des Bots. Sie wird von der // Diese Methode ermittelt den nächsten Zug des Bots. Sie wird von der

View File

@ -28,18 +28,14 @@ public class RumbleBot extends Bot {
@Override @Override
protected char nextMove(View view) { protected char nextMove(View view) {
System.out.println();
int size = view.width; int size = view.width;
String data = view.data; String data = view.data;
char[][] grid = dataToGrid(data, size); char[][] grid = dataToGrid(data, size);
if (data.contains("v") || data.contains("^") || data.contains("<") || data.contains(">")) { if (isInLineOfSight(grid)) {
if (isInLineOfSight(grid)) { return 'f';
return 'f'; } else if (data.contains("v") || data.contains("^") || data.contains("<") || data.contains(">")) {
} else { return breadthFirstSearch(grid);
return breadthFirstSearch(grid);
}
} else { } else {
return walkAround(grid); return walkAround(grid);
} }
@ -96,34 +92,23 @@ public class RumbleBot extends Bot {
protected boolean isInLineOfSight(char[][] grid) { protected boolean isInLineOfSight(char[][] grid) {
int size = grid.length; int size = grid.length;
for (int y = size / 2; y >= 0; y--) { for (int y = size / 2; y >= 0; y--) {
if (obstacles.contains("" + grid[size / 2][y]))
break;
if (players.contains("" + grid[size / 2][y])) if (players.contains("" + grid[size / 2][y]))
return true; return true;
if (obstacles.contains("" + grid[size / 2][y]))
break;
} }
return false; return false;
} }
protected char walkAround(char[][] grid) { protected char walkAround(char[][] grid) {
int size = grid.length;
if (steps == 0) { if (steps == 0) {
steps = random.nextInt(20); steps = random.nextInt(20);
if(random.nextBoolean()) return random.nextBoolean() ? '<' : '>';
return '<';
else
return '>';
} else { } else {
steps--; steps--;
return safeMove(grid); return obstacles.contains("" + grid[size / 2][size / 2 - 1]) ? '<' : '^';
}
}
protected char safeMove(char[][] grid) {
int size = grid.length;
if (obstacles.contains("" + grid[size / 2][size / 2 - 1])) {
return '<';
} else {
return '^';
} }
} }
@ -159,7 +144,7 @@ public class RumbleBot extends Bot {
} }
System.err.println("No path found"); System.err.println("No path found");
return safeMove(grid); return walkAround(grid);
} }
protected record Move(int x, int y, char direction) { protected record Move(int x, int y, char direction) {

View File

@ -3,11 +3,19 @@ import java.util.Queue;
public class SnakeBot extends Bot { public class SnakeBot extends Bot {
protected final static String obstacles = "~#X*"; protected final static String obstacles = "~#X*";
protected final static char target = '@';
protected boolean offByOne = true; protected boolean offByOne = true;
protected int currentStepCount = 0; protected int currentStepCount = 0;
protected int steps = 0; protected int steps = 0;
public static void main(String[] args) { public static void main(String[] args) {
if (args.length == 0) {
String[] dummyArgs = {"localhost", "63187"};
for (int i = 0; i < 5; i++) {
new Thread(new SnakeBot(dummyArgs)).start();
}
}
Bot bot = new SnakeBot(args); Bot bot = new SnakeBot(args);
bot.run(); bot.run();
} }
@ -102,7 +110,7 @@ public class SnakeBot extends Bot {
if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue; if (move.x < 0 || move.x >= size || move.y < 0 || move.y >= size || visited[move.x][move.y]) continue;
visited[move.x][move.y] = true; visited[move.x][move.y] = true;
if (obstacles.contains("" + grid[move.x][move.y])) continue; if (obstacles.contains("" + grid[move.x][move.y])) continue;
if (grid[move.x][move.y] == '@') return move.direction; if (grid[move.x][move.y] == target) return move.direction;
for (int[] direction : directions) { for (int[] direction : directions) {
queue.add(new Move(move.x + direction[0], move.y + direction[1], move.direction)); queue.add(new Move(move.x + direction[0], move.y + direction[1], move.direction));