-var grpc = require('grpc');
-var Chess = require('../www/js/chess.min.js').Chess;
+var grpc = require('@grpc/grpc-js');
var PROTO_PATH = __dirname + '/hashprobe.proto';
-var hashprobe_proto = grpc.load(PROTO_PATH).hashprobe;
+var protoLoader = require('@grpc/proto-loader');
+var packageDefinition = protoLoader.loadSync(
+ PROTO_PATH,
+ {keepCase: true,
+ longs: String,
+ enums: String,
+ defaults: true,
+ oneofs: true
+ });
+var hashprobe_proto = grpc.loadPackageDefinition(packageDefinition).hashprobe;
-// TODO: Make destination configurable.
-var client = new hashprobe_proto.HashProbe('localhost:50051', grpc.credentials.createInsecure());
+/*
+ * validate_fen() is taken from chess.js, which has this license:
+ *
+ * Copyright (c) 2017, Jeff Hlywa (jhlywa@gmail.com)
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright notice,
+ * this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright notice,
+ * this list of conditions and the following disclaimer in the documentation
+ * and/or other materials provided with the distribution.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ * POSSIBILITY OF SUCH DAMAGE.
+ *
+ *----------------------------------------------------------------------------*/
+function validate_fen(fen) {
+ var errors = {
+ 0: 'No errors.',
+ 1: 'FEN string must contain six space-delimited fields.',
+ 2: '6th field (move number) must be a positive integer.',
+ 3: '5th field (half move counter) must be a non-negative integer.',
+ 4: '4th field (en-passant square) is invalid.',
+ 5: '3rd field (castling availability) is invalid.',
+ 6: '2nd field (side to move) is invalid.',
+ 7: '1st field (piece positions) does not contain 8 \'/\'-delimited rows.',
+ 8: '1st field (piece positions) is invalid [consecutive numbers].',
+ 9: '1st field (piece positions) is invalid [invalid piece].',
+ 10: '1st field (piece positions) is invalid [row too large].',
+ 11: 'Illegal en-passant square',
+ };
-var board = new Chess();
+ /* 1st criterion: 6 space-seperated fields? */
+ var tokens = fen.split(/\s+/);
+ if (tokens.length !== 6) {
+ return {valid: false, error_number: 1, error: errors[1]};
+ }
+
+ /* 2nd criterion: move number field is a integer value > 0? */
+ if (isNaN(tokens[5]) || (parseInt(tokens[5], 10) <= 0)) {
+ return {valid: false, error_number: 2, error: errors[2]};
+ }
+
+ /* 3rd criterion: half move counter is an integer >= 0? */
+ if (isNaN(tokens[4]) || (parseInt(tokens[4], 10) < 0)) {
+ return {valid: false, error_number: 3, error: errors[3]};
+ }
+
+ /* 4th criterion: 4th field is a valid e.p.-string? */
+ if (!/^(-|[abcdefgh][36])$/.test(tokens[3])) {
+ return {valid: false, error_number: 4, error: errors[4]};
+ }
+
+ /* 5th criterion: 3th field is a valid castle-string? */
+ if( !/^[C-HK]?[A-FQ]?[c-hk]?[a-fq]?$/.test(tokens[2]) &&
+ tokens[2] !== '-') {
+ return {valid: false, error_number: 5, error: errors[5]};
+ }
+
+ /* 6th criterion: 2nd field is "w" (white) or "b" (black)? */
+ if (!/^(w|b)$/.test(tokens[1])) {
+ return {valid: false, error_number: 6, error: errors[6]};
+ }
+
+ /* 7th criterion: 1st field contains 8 rows? */
+ var rows = tokens[0].split('/');
+ if (rows.length !== 8) {
+ return {valid: false, error_number: 7, error: errors[7]};
+ }
+
+ /* 8th criterion: every row is valid? */
+ for (var i = 0; i < rows.length; i++) {
+ /* check for right sum of fields AND not two numbers in succession */
+ var sum_fields = 0;
+ var previous_was_number = false;
+
+ for (var k = 0; k < rows[i].length; k++) {
+ if (!isNaN(rows[i][k])) {
+ if (previous_was_number) {
+ return {valid: false, error_number: 8, error: errors[8]};
+ }
+ sum_fields += parseInt(rows[i][k], 10);
+ previous_was_number = true;
+ } else {
+ if (!/^[prnbqkPRNBQK]$/.test(rows[i][k])) {
+ return {valid: false, error_number: 9, error: errors[9]};
+ }
+ sum_fields += 1;
+ previous_was_number = false;
+ }
+ }
+ if (sum_fields !== 8) {
+ return {valid: false, error_number: 10, error: errors[10]};
+ }
+ }
+
+ if ((tokens[3][1] == '3' && tokens[1] == 'w') ||
+ (tokens[3][1] == '6' && tokens[1] == 'b')) {
+ return {valid: false, error_number: 11, error: errors[11]};
+ }
+
+ /* everything's okay! */
+ return {valid: true, error_number: 0, error: errors[0]};
+}
+
+var clients = [];
+var current_servers = [];
+
+var need_reinit = function(servers) {
+ if (servers.length != current_servers.length) {
+ return true;
+ }
+ for (var i = 0; i < servers.length; ++i) {
+ if (servers[i] != current_servers[i]) {
+ return true;
+ }
+ }
+ return false;
+}
+exports.need_reinit = need_reinit;
+
+var init = function(servers) {
+ clients = [];
+ for (var i = 0; i < servers.length; ++i) {
+ clients.push(new hashprobe_proto.HashProbe(servers[i], grpc.credentials.createInsecure()));
+ }
+ current_servers = servers;
+}
+exports.init = init;
var handle_request = function(fen, response) {
- if (!board.validate_fen(fen).valid) {
+ if (fen === undefined || fen === null || fen === '' || !validate_fen(fen).valid) {
response.writeHead(400, {});
response.end();
return;
}
- client.probe({fen: fen}, function(err, probe_response) {
- if (err) {
- response.writeHead(500, {});
- response.end();
- } else {
- handle_response(fen, response, probe_response);
- }
- });
+
+ var rpc_status = {
+ failed: false,
+ left: clients.length,
+ responses: [],
+ }
+ for (var i = 0; i < clients.length; ++i) {
+ clients[i].probe({fen: fen}, function(err, probe_response) {
+ if (err) {
+ rpc_status.failed = true;
+ } else {
+ rpc_status.responses.push(probe_response);
+ }
+ if (--rpc_status.left == 0) {
+ // All probes have come back.
+ if (rpc_status.failed) {
+ response.writeHead(500, {});
+ response.end();
+ } else {
+ handle_response(fen, response, rpc_status.responses);
+ }
+ }
+ });
+ }
}
exports.handle_request = handle_request;
-var handle_response = function(fen, response, probe_response) {
+var handle_response = function(fen, response, probe_responses) {
+ var probe_response = reconcile_responses(probe_responses);
var lines = {};
- var root = translate_line(board, fen, probe_response['root']);
+ var root = translate_line(fen, probe_response['root']);
for (var i = 0; i < probe_response['line'].length; ++i) {
var line = probe_response['line'][i];
- var uci_move = line['move']['from_sq'] + line['move']['to_sq'] + line['move']['promotion'];
- lines[uci_move] = translate_line(board, fen, line);
+ var pretty_move = line['move']['pretty'];
+ lines[pretty_move] = translate_line(fen, line);
}
var text = JSON.stringify({
response.end();
}
-var translate_line = function(board, fen, line) {
- var r = {};
- board.load(fen);
- var toplay = board.turn();
-
- if (line['move'] && line['move']['from_sq']) {
- var promo = line['move']['promotion'];
- if (promo) {
- r['pretty_move'] = board.move({ from: line['move']['from_sq'], to: line['move']['to_sq'], promotion: promo.toLowerCase() }).san;
- } else {
- r['pretty_move'] = board.move({ from: line['move']['from_sq'], to: line['move']['to_sq'] }).san;
+var reconcile_responses = function(probe_responses) {
+ var probe_response = {};
+
+ // Select the root that has searched the deepest, plain and simple.
+ probe_response['root'] = probe_responses[0]['root'];
+ for (var i = 1; i < probe_responses.length; ++i) {
+ var root = probe_responses[i]['root'];
+ if (root['depth'] > probe_response['root']['depth']) {
+ probe_response['root'] = root;
}
+ }
+
+ // Do the same ting for each move, combining on move.
+ var moves = {};
+ for (var i = 0; i < probe_responses.length; ++i) {
+ for (var j = 0; j < probe_responses[i]['line'].length; ++j) {
+ var line = probe_responses[i]['line'][j];
+ var pretty_move = line['move']['pretty'];
+
+ if (!moves[pretty_move]) {
+ moves[pretty_move] = line;
+ } else {
+ moves[pretty_move] = reconcile_moves(line, moves[pretty_move]);
+ }
+ }
+ }
+ probe_response['line'] = [];
+ for (var move in moves) {
+ probe_response['line'].push(moves[move]);
+ }
+ return probe_response;
+}
+
+var reconcile_moves = function(a, b) {
+ // Prefer exact bounds, unless the depth is just so much higher.
+ if (a['bound'] === 'BOUND_EXACT' &&
+ b['bound'] !== 'BOUND_EXACT' &&
+ a['depth'] + 10 >= b['depth']) {
+ return a;
+ }
+ if (b['bound'] === 'BOUND_EXACT' &&
+ a['bound'] !== 'BOUND_EXACT' &&
+ b['depth'] + 10 >= a['depth']) {
+ return b;
+ }
+
+ if (a['depth'] > b['depth']) {
+ return a;
} else {
- r['pretty_move'] = '';
+ return b;
+ }
+}
+
+var translate_line = function(fen, line) {
+ var r = {};
+
+ if (line['move'] && line['move']['pretty']) {
+ r['move'] = line['move']['pretty']
+ } else {
+ r['move'] = '';
}
- r['sort_key'] = r['pretty_move'];
if (!line['found']) {
- r['pv_pretty'] = [];
+ r['pv'] = [];
return r;
}
r['depth'] = line['depth'];
// Convert the PV.
var pv = [];
- if (r['pretty_move']) {
- pv.push(r['pretty_move']);
+ if (r['move']) {
+ pv.push(r['move']);
}
for (var j = 0; j < line['pv'].length; ++j) {
var move = line['pv'][j];
- var decoded = board.move({ from: move['from_sq'], to: move['to_sq'], promotion: move['promotion'] });
- if (decoded === null) {
- break;
- }
- pv.push(decoded.san);
+ pv.push(move['pretty']);
}
- r['pv_pretty'] = pv;
+ r['pv'] = pv;
// Convert the score. Use the static eval if no search.
var value = line['value'] || line['eval'];
projects / remoteglot / blobdiff