fenGame now in zig
This commit is contained in:
parent
93e7ff61e0
commit
bb3bc4442a
@ -5,7 +5,7 @@
|
|||||||
long long fullSet(sets *s);
|
long long fullSet(sets *s);
|
||||||
long long fullSetBoth(game *g);
|
long long fullSetBoth(game *g);
|
||||||
void print_bitboard(long long bitboard);
|
void print_bitboard(long long bitboard);
|
||||||
long long *findSet(game *g, long long bit);
|
unsigned long long *findSet(game *g, long long bit);
|
||||||
long long *charToSet(game *g, char c);
|
unsigned long long *charToSet(game *g, char c);
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
|||||||
@ -16,8 +16,6 @@
|
|||||||
|
|
||||||
game *fenGame(char *str);
|
game *fenGame(char *str);
|
||||||
game *playMoves(game *g, char *moves);
|
game *playMoves(game *g, char *moves);
|
||||||
long long *findSet(game *g, long long bit);
|
|
||||||
long long *charToSet(game *g, char c);
|
|
||||||
|
|
||||||
int cmain() {
|
int cmain() {
|
||||||
setbuf(stdin, NULL);
|
setbuf(stdin, NULL);
|
||||||
@ -123,7 +121,7 @@ game *fenGame(char *str) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
long long bit = 1ULL << (rank * 8 + file);
|
long long bit = 1ULL << (rank * 8 + file);
|
||||||
long long *set = charToSet(g, *str);
|
unsigned long long *set = charToSet(g, *str);
|
||||||
if (set)
|
if (set)
|
||||||
*set |= bit;
|
*set |= bit;
|
||||||
file++;
|
file++;
|
||||||
|
|||||||
44
src/main.zig
44
src/main.zig
@ -2,6 +2,7 @@ const std = @import("std");
|
|||||||
const c = @cImport({
|
const c = @cImport({
|
||||||
@cInclude("main.h");
|
@cInclude("main.h");
|
||||||
@cInclude("types.h");
|
@cInclude("types.h");
|
||||||
|
@cInclude("help.h");
|
||||||
});
|
});
|
||||||
|
|
||||||
const uciTag = enum {
|
const uciTag = enum {
|
||||||
@ -27,11 +28,12 @@ pub fn main() !void {
|
|||||||
const stdin = std.io.getStdIn();
|
const stdin = std.io.getStdIn();
|
||||||
var reader = stdin.reader();
|
var reader = stdin.reader();
|
||||||
|
|
||||||
var game: *c.game = uciPos("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1");
|
var game: *c.game = uciPos("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1", alloc);
|
||||||
|
defer alloc.destroy(game);
|
||||||
while (true) {
|
while (true) {
|
||||||
const line = try reader.readUntilDelimiterAlloc(alloc, '\n', std.math.maxInt(usize));
|
const line = try reader.readUntilDelimiterAlloc(alloc, '\n', std.math.maxInt(usize));
|
||||||
defer alloc.free(line);
|
defer alloc.free(line);
|
||||||
switch (uci(line, game)) {
|
switch (uci(line, game, alloc)) {
|
||||||
.text => |value| {
|
.text => |value| {
|
||||||
try std.io.getStdOut().writer().print("{s}", .{value});
|
try std.io.getStdOut().writer().print("{s}", .{value});
|
||||||
},
|
},
|
||||||
@ -39,6 +41,7 @@ pub fn main() !void {
|
|||||||
try std.io.getStdOut().writer().print("bestmove {s}\n", .{value});
|
try std.io.getStdOut().writer().print("bestmove {s}\n", .{value});
|
||||||
},
|
},
|
||||||
.game => |value| {
|
.game => |value| {
|
||||||
|
alloc.destroy(game);
|
||||||
game = value;
|
game = value;
|
||||||
},
|
},
|
||||||
.exit => {
|
.exit => {
|
||||||
@ -51,35 +54,48 @@ pub fn main() !void {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn uci(str: []const u8, game: *c.game) uciRet {
|
fn uci(str: []const u8, game: *c.game, alloc: std.mem.Allocator) uciRet {
|
||||||
const pos = std.mem.indexOfAny(u8, str, " \t\n\r") orelse str.len;
|
const pos = std.mem.indexOfAny(u8, str, " \t\n\r") orelse str.len;
|
||||||
const tok = str[0..pos];
|
const tok = str[0..pos];
|
||||||
if (std.mem.eql(u8, tok, "uci")) return .{ .text = "id name RatChess 0.1\nid author rat<3\nuciok\n" };
|
if (std.mem.eql(u8, tok, "uci")) return .{ .text = "id name RatChess 0.1\nid author rat<3\nuciok\n" };
|
||||||
if (std.mem.eql(u8, tok, "isready")) return .{ .text = "readyok\n" };
|
if (std.mem.eql(u8, tok, "isready")) return .{ .text = "readyok\n" };
|
||||||
if (std.mem.eql(u8, tok, "go")) return .{ .move = uciGo(game) };
|
if (std.mem.eql(u8, tok, "go")) return .{ .move = uciGo(game) };
|
||||||
if (std.mem.eql(u8, tok, "position")) return .{ .game = uciPos(str[(pos + 1)..]) };
|
if (std.mem.eql(u8, tok, "position")) return .{ .game = uciPos(str[(pos + 1)..], alloc) };
|
||||||
if (std.mem.eql(u8, tok, "exit")) return .{ .exit = {} };
|
if (std.mem.eql(u8, tok, "exit")) return .{ .exit = {} };
|
||||||
return .{ .pass = {} };
|
return .{ .pass = {} };
|
||||||
}
|
}
|
||||||
|
|
||||||
fn uciPos(str: []const u8) [*c]c.game {
|
fn uciPos(str: []const u8, alloc: std.mem.Allocator) [*c]c.game {
|
||||||
const pos = std.mem.indexOfAny(u8, str, " \t\n\r") orelse str.len;
|
const pos = std.mem.indexOfAny(u8, str, " \t\n\r") orelse str.len;
|
||||||
const tok = str[0..pos];
|
const tok = str[0..pos];
|
||||||
var game = fenGame("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1");
|
var game = fenGame("rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1", alloc);
|
||||||
if (std.mem.eql(u8, tok, "fen")) return fenGame(str[pos..]);
|
if (std.mem.eql(u8, tok, "fen")) return fenGame(str[pos..], alloc);
|
||||||
if (std.mem.eql(u8, tok, "startpos")) {
|
if (std.mem.eql(u8, tok, "startpos")) {
|
||||||
game = playMoves(game, str[pos..]);
|
game = playMoves(game, str[pos..]);
|
||||||
}
|
}
|
||||||
return game;
|
return game;
|
||||||
}
|
}
|
||||||
|
|
||||||
fn fenGame(str: []const u8) [*c]c.game {
|
fn fenGame(str: []const u8, alloc: std.mem.Allocator) [*c]c.game {
|
||||||
var buffer: [256]u8 = undefined;
|
var pos: u8 = 0;
|
||||||
const len = @min(str.len, buffer.len - 1);
|
var space: u8 = 0;
|
||||||
@memcpy(buffer[0..len], str[0..len]);
|
const g = alloc.create(c.game) catch return null;
|
||||||
buffer[len] = 0;
|
for (str) |chr| {
|
||||||
|
if (pos > 64) {
|
||||||
return c.fenGame(&buffer);
|
if (chr == ' ') space += 1;
|
||||||
|
if (space == 1 and chr == 'b') g.whiteToMove = false;
|
||||||
|
if (space == 1 and chr == 'w') g.whiteToMove = false;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
if (std.ascii.isDigit(chr)) pos += @truncate(chr - '0');
|
||||||
|
if (chr == '/') continue;
|
||||||
|
const set: [*c]c_ulonglong = c.charToSet(g, chr);
|
||||||
|
const bit: u64 = @as(u64, 1) << @truncate(pos);
|
||||||
|
if (set != null)
|
||||||
|
set.* |= @as(c_ulonglong, bit);
|
||||||
|
pos += 1;
|
||||||
|
}
|
||||||
|
return g;
|
||||||
}
|
}
|
||||||
|
|
||||||
fn playMoves(game: [*c]c.game, str: []const u8) [*c]c.game {
|
fn playMoves(game: [*c]c.game, str: []const u8) [*c]c.game {
|
||||||
|
|||||||
@ -28,22 +28,22 @@ int pawnMove(game *g, move *moves) {
|
|||||||
|
|
||||||
// forword
|
// forword
|
||||||
int to = i + movdir;
|
int to = i + movdir;
|
||||||
p = (promo & (1ULL << to)) ? 'q' : 0;
|
|
||||||
if (to >= 0 && to < 64 && !(occupied & (1ULL << to))) {
|
if (to >= 0 && to < 64 && !(occupied & (1ULL << to))) {
|
||||||
|
p = (promo & (1ULL << to)) ? 'q' : 0;
|
||||||
moves[index++] = (move){.From = i, .To = to, .Promo = p};
|
moves[index++] = (move){.From = i, .To = to, .Promo = p};
|
||||||
}
|
}
|
||||||
|
|
||||||
// left
|
// left
|
||||||
to = i + capLeft;
|
to = i + capLeft;
|
||||||
p = (promo & (1ULL << to)) ? 'q' : 0;
|
|
||||||
if (i % 8 > 0 && (to >= 0 && to < 64) && (enemy & (1ULL << to))) {
|
if (i % 8 > 0 && (to >= 0 && to < 64) && (enemy & (1ULL << to))) {
|
||||||
|
p = (promo & (1ULL << to)) ? 'q' : 0;
|
||||||
moves[index++] = (move){.From = i, .To = to, .Promo = p};
|
moves[index++] = (move){.From = i, .To = to, .Promo = p};
|
||||||
}
|
}
|
||||||
|
|
||||||
// right
|
// right
|
||||||
to = i + capRight;
|
to = i + capRight;
|
||||||
p = (promo & (1ULL << to)) ? 'q' : 0;
|
|
||||||
if (i % 8 < 7 && (to >= 0 && to < 64) && (enemy & (1ULL << to))) {
|
if (i % 8 < 7 && (to >= 0 && to < 64) && (enemy & (1ULL << to))) {
|
||||||
|
p = (promo & (1ULL << to)) ? 'q' : 0;
|
||||||
moves[index++] = (move){.From = i, .To = to, .Promo = p};
|
moves[index++] = (move){.From = i, .To = to, .Promo = p};
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@ -78,6 +78,7 @@ int knightMove(game *g, move *moves) {
|
|||||||
(fileDiff == 2 && rankDiff == 1)))
|
(fileDiff == 2 && rankDiff == 1)))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
|
if(to < 0 || to > 63) continue;
|
||||||
long long destBit = 1ULL << to;
|
long long destBit = 1ULL << to;
|
||||||
if (occupied & destBit)
|
if (occupied & destBit)
|
||||||
continue;
|
continue;
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user