Feat/add uci and gui

src/main.zig

@@ -9,12 +9,12 @@ const move_gen = @import("move_generation.zig");
 const uci = @import("uci.zig");
 
 pub fn main() !void {
-    attacks.init_attacks();
-
-    var b = types.Board.new();
-    try bitboard.fan_pars(types.start_position, &b);
-
-    bitboard.print_unicode_board(b);
+    // attacks.init_attacks();
+    //
+    // var b = types.Board.new();
+    // try bitboard.fan_pars(types.start_position, &b);
+    //
+    // bitboard.print_unicode_board(b);
 
     // var movesWhite: lists.MoveList = .{};
     // move_gen.generate_moves(&b, &movesWhite, types.Color.Black);
@@ -34,9 +34,10 @@ pub fn main() !void {
     //         print("Illegal move made", .{});
     //     }
     // }
-    //
+    var gpa = std.heap.GeneralPurposeAllocator(.{}){};
+    defer _ = gpa.deinit();
+    const allocator = gpa.allocator();
 
-    //util.perft_test(&b, 5);
-    //
-    util.perft_test_detailed(&b, 5);
+    var game = uci.UCI.new(allocator);
+    try game.uci_loop();
 }

src/search.zig

@@ -0,0 +1,13 @@
+const std = @import("std");
+const types = @import("types.zig");
+const print = std.debug.print;
+
+pub fn search_position(uci_ref: anytype, depth: ?u8, time_ms: u64) void {
+    _ = depth;
+    _ = time_ms;
+
+    uci_ref.is_searching = true;
+    print("bestmove {s}\n", .{"e2e4"});
+
+    uci_ref.is_searching = false;
+}

src/uci.zig

@@ -0,0 +1,302 @@
+const std = @import("std");
+const attacks = @import("attacks.zig");
+const types = @import("types.zig");
+const util = @import("util.zig");
+const bitboard = @import("bitboard.zig");
+const move_gen = @import("move_generation.zig");
+const print = std.debug.print;
+const search = @import("search.zig");
+const lists = @import("lists.zig");
+
+const UCI_COMMANDS_MAX: usize = 10000;
+const VERSION: []const u8 = "0.1";
+const ENGINE_NAME: []const u8 = "NeuroSpeed";
+const AUTHOR: []const u8 = "Jakob Dekleva";
+
+pub const UCI = struct {
+    board: types.Board,
+    allocator: std.mem.Allocator,
+    is_searching: bool,
+    stop_search: bool,
+    search_thread: ?std.Thread,
+
+    // new uci
+    pub fn new(allocator: std.mem.Allocator) UCI {
+        attacks.init_attacks();
+        var board = types.Board.new();
+        bitboard.fan_pars(types.start_position, &board) catch {
+            print("Error parsing fen in the new uci function\n", .{});
+        };
+        return UCI{
+            .board = board,
+            .allocator = allocator,
+            .is_searching = false,
+            .stop_search = false,
+            .search_thread = null,
+        };
+    }
+
+    // parse moves
+    fn parse_move(self: *UCI, move_string: []const u8) ?move_gen.Move {
+        if (move_string.len < 4) return null;
+
+        // Parse source and target squares
+        const from_file = move_string[0] - 'a';
+        const from_rank = move_string[1] - '1';
+        const to_file = move_string[2] - 'a';
+        const to_rank = move_string[3] - '1';
+
+        if (from_file > 7 or from_rank > 7 or to_file > 7 or to_rank > 7) return null;
+
+        const from_square: u6 = @intCast(from_rank * 8 + from_file);
+        const to_square: u6 = @intCast(to_rank * 8 + to_file);
+
+        // Generate legal moves to find the matching move
+        var move_list: lists.MoveList = .{};
+        if (self.board.side == types.Color.White) {
+            move_gen.generate_moves(&self.board, &move_list, types.Color.White);
+        } else {
+            move_gen.generate_moves(&self.board, &move_list, types.Color.Black);
+        }
+
+        // Find matching move
+        for (0..move_list.count) |i| {
+            const move = move_list.moves[i];
+            if (move.from == from_square and move.to == to_square) {
+                if (move_string.len >= 5) {
+                    const promotion_piece = move_string[4];
+                    const expected_flag = switch (promotion_piece) {
+                        'q' => if (move_gen.Print_move_list.is_capture(move)) types.MoveFlags.PC_QUEEN else types.MoveFlags.PR_QUEEN,
+                        'r' => if (move_gen.Print_move_list.is_capture(move)) types.MoveFlags.PC_ROOK else types.MoveFlags.PR_ROOK,
+                        'b' => if (move_gen.Print_move_list.is_capture(move)) types.MoveFlags.PC_BISHOP else types.MoveFlags.PR_BISHOP,
+                        'n' => if (move_gen.Print_move_list.is_capture(move)) types.MoveFlags.PC_KNIGHT else types.MoveFlags.PR_KNIGHT,
+                        else => continue,
+                    };
+                    if (move.flags == expected_flag) return move;
+                } else {
+                    if (!move_gen.Print_move_list.is_promotion(move)) return move;
+                }
+            }
+        }
+
+        return null;
+    }
+
+    // Parse a position command
+    fn parse_position(self: *UCI, command: []const u8) !void {
+        var tokens = std.mem.tokenizeScalar(u8, command, ' ');
+        _ = tokens.next(); // Skip "position"
+
+        const position_type = tokens.next() orelse return;
+
+        if (std.mem.eql(u8, position_type, "startpos")) {
+            try bitboard.fan_pars(types.start_position, &self.board);
+        } else if (std.mem.eql(u8, position_type, "fen")) {
+            var fen_buffer: [256]u8 = undefined;
+            var fen_len: usize = 0;
+
+            var parts_count: u8 = 0;
+            while (parts_count < 6) : (parts_count += 1) {
+                const part = tokens.next() orelse break;
+                if (std.mem.eql(u8, part, "moves")) break;
+
+                if (fen_len > 0) {
+                    fen_buffer[fen_len] = ' ';
+                    fen_len += 1;
+                }
+                @memcpy(fen_buffer[fen_len .. fen_len + part.len], part);
+                fen_len += part.len;
+            }
+
+            if (fen_len > 0) {
+                try bitboard.fan_pars(fen_buffer[0..fen_len], &self.board);
+            }
+        }
+
+        const rest = tokens.rest();
+        if (rest.len > 0) {
+            var moves_tokens = std.mem.tokenizeScalar(u8, rest, ' ');
+            if (moves_tokens.next()) |first_token| {
+                if (std.mem.eql(u8, first_token, "moves")) {
+                    // Parse and play moves
+                    while (moves_tokens.next()) |move_str| {
+                        if (self.parse_move(move_str)) |move| {
+                            _ = move_gen.make_move(&self.board, move);
+                        }
+                    }
+                }
+            }
+        }
+    }
+
+    // parse go
+    fn parse_go(self: *UCI, command: []const u8) void {
+        var tokens = std.mem.tokenizeScalar(u8, command, ' ');
+        _ = tokens.next(); // Skip "go"
+
+        var depth: ?u8 = null;
+        var movetime: ?u64 = null;
+        var wtime: ?u64 = null;
+        var btime: ?u64 = null;
+        var winc: ?u64 = null;
+        var binc: ?u64 = null;
+        var movestogo: ?u64 = null;
+        var infinite = false;
+
+        while (tokens.next()) |token| {
+            if (std.mem.eql(u8, token, "depth")) {
+                if (tokens.next()) |depth_str| {
+                    depth = std.fmt.parseUnsigned(u8, depth_str, 10) catch null;
+                }
+            } else if (std.mem.eql(u8, token, "movetime")) {
+                if (tokens.next()) |time_str| {
+                    movetime = std.fmt.parseUnsigned(u64, time_str, 10) catch null;
+                }
+            } else if (std.mem.eql(u8, token, "wtime")) {
+                if (tokens.next()) |time_str| {
+                    wtime = std.fmt.parseUnsigned(u64, time_str, 10) catch null;
+                }
+            } else if (std.mem.eql(u8, token, "btime")) {
+                if (tokens.next()) |time_str| {
+                    btime = std.fmt.parseUnsigned(u64, time_str, 10) catch null;
+                }
+            } else if (std.mem.eql(u8, token, "winc")) {
+                if (tokens.next()) |inc_str| {
+                    winc = std.fmt.parseUnsigned(u64, inc_str, 10) catch null;
+                }
+            } else if (std.mem.eql(u8, token, "binc")) {
+                if (tokens.next()) |inc_str| {
+                    binc = std.fmt.parseUnsigned(u64, inc_str, 10) catch null;
+                }
+            } else if (std.mem.eql(u8, token, "movestogo")) {
+                if (tokens.next()) |moves_str| {
+                    movestogo = std.fmt.parseUnsigned(u64, moves_str, 10) catch null;
+                }
+            } else if (std.mem.eql(u8, token, "infinite")) {
+                infinite = true;
+            }
+        }
+
+        // Calculate time for move
+        var calculated_time: u64 = 1000;
+
+        if (movetime) |mt| {
+            calculated_time = mt;
+        } else if (infinite) {
+            calculated_time = 1000000; // Very long time for infinite
+        } else {
+            // Calculate time based on remaining time and increment
+            var my_time: ?u64 = null;
+            var my_inc: ?u64 = null;
+
+            if (self.board.side == types.Color.White) {
+                my_time = wtime;
+                my_inc = winc;
+            } else {
+                my_time = btime;
+                my_inc = binc;
+            }
+
+            if (my_time) |time| {
+                const inc = my_inc orelse 0;
+                if (movestogo) |moves| {
+                    // Fixed number of moves
+                    calculated_time = (time / moves) + inc;
+                } else {
+                    // Sudden death or increment
+                    calculated_time = (time / 30) + inc; // Assume 30 moves left
+                }
+                calculated_time = @min(calculated_time, time - 100); // Leave 100ms buffer
+                calculated_time = @max(calculated_time, 100); // Minimum 100ms
+            }
+        }
+
+        // Start search in a separate thread
+        self.search_thread = std.Thread.spawn(.{}, searchWrapper, .{ self, depth, calculated_time }) catch null;
+    }
+
+    fn searchWrapper(self: *UCI, depth: ?u8, time_ms: u64) void {
+        search.search_position(self, depth, time_ms);
+    }
+    // main loop
+    pub fn uci_loop(self: *UCI) !void {
+        var stdin = std.io.getStdIn().reader();
+        var stdout = std.io.getStdOut().writer();
+
+        try stdout.print("NeuroSpeed version {s}\n", .{VERSION});
+
+        const buffer = try self.allocator.alloc(u8, UCI_COMMANDS_MAX);
+        defer self.allocator.free(buffer);
+
+        while (true) {
+            if (stdin.readUntilDelimiterOrEof(buffer, '\n')) |maybe_line| {
+                const line = maybe_line orelse break;
+                const trimmed = std.mem.trim(u8, line, " \r\n\t");
+
+                if (trimmed.len == 0) continue;
+
+                var tokens = std.mem.tokenizeScalar(u8, trimmed, ' ');
+                const command = tokens.next() orelse continue;
+
+                if (std.mem.eql(u8, command, "quit")) {
+                    break;
+                } else if (std.mem.eql(u8, command, "uci")) {
+                    try stdout.print("id name {s} {s}\n", .{ ENGINE_NAME, VERSION });
+                    try stdout.print("id author {s}\n", .{AUTHOR});
+                    try stdout.print("uciok\n", .{});
+                } else if (std.mem.eql(u8, command, "isready")) {
+                    try stdout.print("readyok\n", .{});
+                } else if (std.mem.eql(u8, command, "ucinewgame")) {
+                    // Reset board to starting position
+                    self.board = types.Board.new();
+                    try bitboard.fan_pars(types.start_position, &self.board);
+                    self.stop_search = true;
+                    if (self.search_thread) |thread| {
+                        thread.join();
+                        self.search_thread = null;
+                    }
+                } else if (std.mem.eql(u8, command, "position")) {
+                    try self.parse_position(trimmed);
+                } else if (std.mem.eql(u8, command, "go")) {
+                    if (!self.is_searching) {
+                        self.parse_go(trimmed);
+                    }
+                } else if (std.mem.eql(u8, command, "stop")) {
+                    self.stop_search = true;
+                } else if (std.mem.eql(u8, command, "d")) {
+                    // Debug command to display board
+                    bitboard.print_unicode_board(self.board);
+                } else if (std.mem.eql(u8, command, "perft")) {
+                    // Perft command for testing
+                    // var depth: u8 = 1;
+                    // if (tokens.next()) |depth_str| {
+                    //     depth = std.fmt.parseUnsigned(u8, depth_str, 10) catch 1;
+                    // }
+                    //
+                    // const nodes = if (self.board.side == types.Color.White)
+                    //     util.perft(types.Color.White, &self.board, depth)
+                    // else
+                    //     util.perft(types.Color.Black, &self.board, depth);
+                    //
+                    // try stdout.print("Nodes searched: {d}\n", .{nodes});
+                } else if (std.mem.eql(u8, command, "setoption")) {
+                    // Parse setoption command (currently just ignore)
+                    // Format: setoption name <name> value <value>
+                    // You can implement option handling here
+                } else {
+                    // Unknown command - ignore as per UCI spec
+                }
+            } else |err| {
+                // Handle read error
+                print("Error reading input: {}\n", .{err});
+                break;
+            }
+        }
+
+        // Clean up
+        if (self.search_thread) |thread| {
+            self.stop_search = true;
+            thread.join();
+        }
+    }
+};