BotRoss/src/RumbleBot.java

import java.util.LinkedList;
import java.util.Queue;

public class RumbleBot extends Bot {
    protected final static String obstacles = "~#X*";
    protected final static String targets = "v^<>";
    protected boolean offByOne = true;
    protected int currentStepCount = 0;
    protected int steps = 0;

    public static void main(String[] args) {
        if(args.length == 0) {
            String[] dummyArgs = {"localhost", "63187"};
            DummyBot dummy = new DummyBot(dummyArgs);
            new Thread(dummy).start();
        }

        Bot bot = new RumbleBot(args);
        bot.run();
    }

    protected RumbleBot(String[] args) {
        super(args);
    }

    @Override
    protected char nextMove(View view) {
        System.out.println();

        int size = view.width;
        String data = view.data;
        char[][] grid = dataToGrid(data, size);

        if (data.contains("v") || data.contains("^") || data.contains("<") || data.contains(">")) {
            if (isInLineOfSight(grid)) {
                return 'f';
            } else {
                return breadthFirstSearch(grid);
            }
        } else {
            return walkAround(grid);
        }
    }

    protected char[][] dataToGrid(String data, int size) {
        char[][] grid = new char[size][size];
        for (int i = 0; i < data.length(); i++) {
            grid[i % size][i / size] = data.charAt(i);
        }
        return markFiringLines(grid);
    }

    protected char[][] markFiringLines(char[][] grid) {
        return grid;
    }

    protected boolean isInLineOfSight(char[][] grid) {
        int size = grid.length;
        for (int y = size / 2; y > 0; y--) {
            if (obstacles.contains("" + grid[size / 2][y]))
                break;

            if (targets.contains("" + grid[size / 2][y]))
                return true;
        }
        return false;
    }

    protected char walkAround(char[][] grid) {
        if (steps == 0) {
            currentStepCount = (currentStepCount + 1) % 10;
            if (offByOne) {
                currentStepCount++;
            }
            offByOne = !offByOne;
            steps = currentStepCount;
            return '>';
        } else {
            steps--;
            return safeMove(grid);
        }
    }

    protected char safeMove(char[][] grid) {
        int size = grid.length;
        if (obstacles.contains("" + grid[size / 2][size / 2 - 1])) {
            return '<';
        } else {
            return '^';
        }
    }

    protected char breadthFirstSearch(char[][] grid) {
        int size = grid.length;
        int start = size / 2;

        boolean[][] visited = new boolean[size][size];
        Queue<Move> queue = new LinkedList<>();

        int[][] directions = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
        char[] commands = {'^', 'v', '>', '<'};
        for (int i = 0; i < 4; i++) {
            queue.add(new Move(start + directions[i][0], start + directions[i][1], commands[i]));
        }

        while (!queue.isEmpty()) {
            Move move = queue.poll();
            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;
            if (obstacles.contains("" + grid[move.x][move.y])) continue;
            if (targets.contains("" + grid[move.x][move.y])) return move.direction;

            for (int[] direction : directions) {
                queue.add(new Move(move.x + direction[0], move.y + direction[1], move.direction));
            }
        }

        System.err.println("No path found");
        return safeMove(grid);
    }

    protected record Move(int x, int y, char direction) {
    }

}