4 # remoteglot - Connects an abitrary UCI-speaking engine to ICS for easier post-game
5 # analysis, or for live analysis of relayed games. (Do not use for
6 # cheating! Cheating is bad for your karma, and your abuser flag.)
8 # Copyright 2007 Steinar H. Gunderson <sgunderson@bigfoot.com>
9 # Licensed under the GNU General Public License, version 2.
19 $SIG{ALRM} = sub { output_screen(); };
23 my $server = "freechess.org";
25 # my $engine = "/usr/games/toga2";
26 my $engine = "wine Rybkav2.3.2a.mp.w32.exe";
28 open(FICSLOG, ">ficslog.txt")
29 or die "ficslog.txt: $!";
30 print FICSLOG "Log starting.\n";
34 open(UCILOG, ">ucilog.txt")
35 or die "ucilog.txt: $!";
36 print UCILOG "Log starting.\n";
41 # open the chess engine
42 my $pid = IPC::Open2::open2(*UCIREAD, *UCIWRITE, $engine);
53 uciprint("setoption name UCI_AnalyseMode value true");
54 uciprint("setoption name NalimovPath value c:\\nalimov");
55 uciprint("setoption name NalimovUsage value Rarely");
56 uciprint("setoption name Hash value 1024");
57 # uciprint("setoption name MultiPV value 3");
58 # uciprint("setoption name Contempt value 1000");
59 # uciprint("setoption name Outlook value Ultra Optimistic");
60 uciprint("ucinewgame");
62 print "Chess engine ready.\n";
65 my $t = Net::Telnet->new(Timeout => 10, Prompt => '/fics% /');
66 $t->input_log(\*FICSLOG);
69 $t->waitfor('/Press return to enter the server/');
73 $t->cmd("set shout 0");
74 $t->cmd("set seek 0");
75 $t->cmd("set style 12");
76 $t->cmd("observe $target");
79 print "FICS ready.\n";
83 vec($rin, fileno(UCIREAD), 1) = 1;
84 vec($rin, fileno($t), 1) = 1;
86 my ($nfound, $timeleft) = select($rout=$rin, undef, undef, 5.0);
90 my $line = $t->getline(Timeout => 0, errmode => 'return');
91 last if (!defined($line));
95 if ($line =~ /^<12> /) {
96 my $fen = style12_to_fen($line);
98 uciprint("position fen $fen");
99 uciprint("go infinite");
101 #print "FICS: [$line]\n";
105 # any fun on the UCI channel?
106 if ($nfound > 0 && vec($rout, fileno(UCIREAD), 1) == 1) {
107 my $line = <UCIREAD>;
110 print UCILOG "<= $line\n";
111 if ($line =~ /^info/) {
112 my (@infos) = split / /, $line;
119 # don't update too often
120 Time::HiRes::alarm(0.2);
130 while (scalar @x > 0) {
131 if ($x[0] =~ 'multipv') {
136 if ($x[0] =~ /^(currmove|currmovenumber|cpuload)$/) {
138 my $value = shift @x;
139 $uciinfo{$key} = $value;
142 if ($x[0] =~ /^(depth|seldepth|hashfull|time|nodes|nps|tbhits)$/) {
144 my $value = shift @x;
145 $uciinfo{$key . $mpv} = $value;
148 if ($x[0] eq 'score') {
151 delete $uciinfo{'score_cp' . $mpv};
152 delete $uciinfo{'score_mate' . $mpv};
154 while ($x[0] =~ /^(cp|mate|lowerbound|upperbound)$/) {
157 $uciinfo{'score_cp' . $mpv} = shift @x;
158 } elsif ($x[0] eq 'mate') {
160 $uciinfo{'score_mate' . $mpv} = shift @x;
168 $uciinfo{'pv' . $mpv} = [ @x[1..$#x] ];
171 if ($x[0] eq 'string' || $x[0] eq 'UCI_AnalyseMode' || $x[0] eq 'setting' || $x[0] eq 'contempt') {
175 #print "unknown info '$x[0]', trying to recover...\n";
177 die "Unknown info '" . join(',', @x) . "'";
184 my (@x) = split / /, $str;
186 $ficsinfo{'board'} = [ @x[1..8] ];
187 $ficsinfo{'toplay'} = $x[9];
190 my (@board) = @x[1..8];
191 for my $rank (0..7) {
192 $board[$rank] =~ s/(-+)/length($1)/ge;
194 my $fen = join('/', @board);
196 # white/black to move
202 $castling .= "K" if ($x[11] == 1);
203 $castling .= "Q" if ($x[12] == 1);
204 $castling .= "k" if ($x[13] == 1);
205 $castling .= "q" if ($x[14] == 1);
206 $castling = "-" if ($castling eq "");
214 my $nep = (qw(a b c d e f g h))[$col];
223 # Showing the en passant square when actually no capture can be made
224 # seems to confuse at least Rybka. Thus, check if there's actually
225 # a pawn of the opposite side that can do the en passant move, and if
226 # not, just lie -- it doesn't matter anyway. I'm unsure what's the
227 # "right" thing as per the standard, though.
230 $ep = $nep if ($col > 0 && substr($board[4], $col-1, 1) eq 'p');
231 $ep = $nep if ($col < 7 && substr($board[4], $col+1, 1) eq 'p');
233 $ep = $nep if ($col > 0 && substr($board[3], $col-1, 1) eq 'P');
234 $ep = $nep if ($col < 7 && substr($board[3], $col+1, 1) eq 'P');
252 my ($board, @pvs) = @_;
254 if (scalar @pvs == 0 || !defined($pvs[0])) {
259 my $from_col = ord(substr($pv, 0, 1)) - ord('a');
260 my $from_row = 7 - (ord(substr($pv, 1, 1)) - ord('1'));
261 my $to_col = ord(substr($pv, 2, 1)) - ord('a');
262 my $to_row = 7 - (ord(substr($pv, 3, 1)) - ord('1'));
265 my $piece = substr($board->[$from_row], $from_col, 1);
267 # white short castling
268 if ($pv eq 'e1g1' && $piece eq 'K') {
272 substr($nb[7], 4, 1, '-');
273 substr($nb[7], 6, 1, $piece);
276 substr($nb[7], 7, 1, '-');
277 substr($nb[7], 5, 1, 'R');
279 return ('0-0', prettyprint_pv(\@nb, @pvs));
282 # white long castling
283 if ($pv eq 'e1c1' && $piece eq 'K') {
287 substr($nb[7], 4, 1, '-');
288 substr($nb[7], 2, 1, $piece);
291 substr($nb[7], 0, 1, '-');
292 substr($nb[7], 3, 1, 'R');
294 return ('0-0-0', prettyprint_pv(\@nb, @pvs));
297 # black short castling
298 if ($pv eq 'e8g8' && $piece eq 'k') {
302 substr($nb[0], 4, 1, '-');
303 substr($nb[0], 6, 1, $piece);
306 substr($nb[0], 7, 1, '-');
307 substr($nb[0], 5, 1, 'r');
309 return ('0-0', prettyprint_pv(\@nb, @pvs));
312 # black long castling
313 if ($pv eq 'e8c8' && $piece eq 'k') {
317 substr($nb[0], 4, 1, '-');
318 substr($nb[0], 2, 1, $piece);
321 substr($nb[0], 0, 1, '-');
322 substr($nb[0], 3, 1, 'r');
324 return ('0-0-0', prettyprint_pv(\@nb, @pvs));
327 # check if the from-piece is a pawn
328 if (lc($piece) eq 'p') {
330 if (substr($board->[$to_row], $to_col, 1) ne '-') {
331 $pretty = substr($pv, 0, 1) . 'x' . substr($pv, 2, 2);
333 $pretty = substr($pv, 2, 2);
335 if (length($pv) == 5) {
338 $pretty .= uc(substr($pv, 4, 1));
341 $piece = substr($pv, 4, 1);
343 $piece = uc(substr($pv, 4, 1));
348 $pretty = uc($piece);
350 # see how many of these pieces could go here, in all
354 next unless (substr($board->[$row], $col, 1) eq $piece);
355 ++$num_total if (can_reach($board, $piece, $row, $col, $to_row, $to_col));
359 # see how many of these pieces from the given row could go here
362 next unless (substr($board->[$from_row], $col, 1) eq $piece);
363 ++$num_row if (can_reach($board, $piece, $from_row, $col, $to_row, $to_col));
366 # and same for columns
369 next unless (substr($board->[$row], $from_col, 1) eq $piece);
370 ++$num_col if (can_reach($board, $piece, $row, $from_col, $to_row, $to_col));
373 # see if we need to disambiguate
374 if ($num_total > 1) {
376 $pretty .= substr($pv, 0, 1);
377 } elsif ($num_row == 1) {
378 $pretty .= substr($pv, 1, 1);
380 $pretty .= substr($pv, 0, 2);
385 if (substr($board->[$to_row], $to_col, 1) ne '-') {
389 $pretty .= substr($pv, 2, 2);
394 substr($nb[$from_row], $from_col, 1, '-');
395 substr($nb[$to_row], $to_col, 1, $piece);
399 } elsif (in_check(\@nb) ne 'none') {
403 return ($pretty, prettyprint_pv(\@nb, @pvs));
409 print "
\ecAnalysis:\n";
411 return unless (exists($ficsinfo{'board'}));
413 if (exists($uciinfo{'pv1'})) {
416 while (exists($uciinfo{'pv' . $mpv})) {
417 printf " PV%2u", $mpv;
419 if (defined($uciinfo{'score_mate' . $mpv})) {
420 printf " (M%3d)", $uciinfo{'score_mate' . $mpv};
422 if (exists($uciinfo{'score_cp' . $mpv})) {
423 my $score = $uciinfo{'score_cp' . $mpv} * 0.01;
424 if ($ficsinfo{'toplay'} eq 'B') {
427 printf " (%+5.2f)", $score;
431 if (exists($uciinfo{'nodes' . $mpv}) && exists($uciinfo{'nps' . $mpv}) && exists($uciinfo{'depth' . $mpv})) {
432 printf " (%5u kn, %3u kn/s, %2u ply)",
433 $uciinfo{'nodes' . $mpv} / 1000, $uciinfo{'nps' . $mpv} / 1000, $uciinfo{'depth' . $mpv};
437 print " ", join(', ', prettyprint_pv($ficsinfo{'board'}, @{$uciinfo{'pv' . $mpv}})), "\n";
443 if (defined($uciinfo{'score_mate'})) {
444 printf " Mate in %d\n", $uciinfo{'score_mate'};
446 if (exists($uciinfo{'score_cp'})) {
447 my $score = $uciinfo{'score_cp'} * 0.01;
448 if ($ficsinfo{'toplay'} eq 'B') {
451 printf " Score: %+5.2f\n", $score;
455 print " PV: ", join(', ', prettyprint_pv($ficsinfo{'board'}, @{$uciinfo{'pv'}}));
458 if (exists($uciinfo{'nodes'}) && exists($uciinfo{'nps'}) && exists($uciinfo{'depth'})) {
459 printf " %u nodes, %7u nodes/sec, depth %u ply",
460 $uciinfo{'nodes'}, $uciinfo{'nps'}, $uciinfo{'depth'};
462 if (exists($uciinfo{'tbhits'})) {
463 printf ", %u Nalimov hits", $uciinfo{'tbhits'};
465 if (exists($uciinfo{'seldepth'})) {
466 printf " (%u selective)", $uciinfo{'seldepth'};
474 my ($wkr, $wkc, $bkr, $bkc);
478 my $piece = substr($board->[$row], $col, 1);
480 ($wkr, $wkc) = ($row, $col);
481 } elsif ($piece eq 'k') {
482 ($bkr, $bkc) = ($row, $col);
487 return ($wkr, $wkc, $bkr, $bkc);
492 my $check = in_check($board);
493 return 0 if ($check eq 'none');
495 # try all possible moves for the side in check
498 my $piece = substr($board->[$row], $col, 1);
499 next if ($piece eq '-');
501 if ($check eq 'white') {
502 next if ($piece eq lc($piece));
504 next if ($piece eq uc($piece));
507 for my $dest_row (0..7) {
508 for my $dest_col (0..7) {
509 next if ($row == $dest_row && $col == $dest_col);
510 next unless (can_reach($board, $piece, $row, $col, $dest_row, $dest_col));
513 substr($nb[$row], $col, 1, '-');
514 substr($nb[$dest_row], $dest_col, 1, $piece);
516 my $new_check = in_check(\@nb);
517 return 0 if ($new_check ne $check && $new_check ne 'both');
523 # nothing to do; mate
529 my ($black_check, $white_check) = (0, 0);
531 my ($wkr, $wkc, $bkr, $bkc) = find_kings($board);
533 # check all pieces for the possibility of threatening the two kings
536 my $piece = substr($board->[$row], $col, 1);
537 next if ($piece eq '-' || lc($piece) eq 'k');
539 if (uc($piece) eq $piece) {
541 $black_check = 1 if (can_reach($board, $piece, $row, $col, $bkr, $bkc));
544 $white_check = 1 if (can_reach($board, $piece, $row, $col, $wkr, $wkc));
549 if ($black_check && $white_check) {
551 } elsif ($black_check) {
553 } elsif ($white_check) {
561 my ($board, $piece, $from_row, $from_col, $to_row, $to_col) = @_;
563 # can't eat your own piece
564 my $dest_piece = substr($board->[$to_row], $to_col, 1);
565 if ($dest_piece ne '-') {
566 return 0 if (($piece eq lc($piece)) == ($dest_piece eq lc($dest_piece)));
569 if (lc($piece) eq 'k') {
570 return (abs($from_row - $to_row) <= 1 && abs($from_col - $to_col) <= 1);
572 if (lc($piece) eq 'r') {
573 return 0 unless ($from_row == $to_row || $from_col == $to_col);
575 # check that there's a clear passage
576 if ($from_row == $to_row) {
577 if ($from_col > $to_col) {
578 ($to_col, $from_col) = ($from_col, $to_col);
581 for my $c (($from_col+1)..($to_col-1)) {
582 my $middle_piece = substr($board->[$to_row], $c, 1);
583 return 0 if ($middle_piece ne '-');
588 if ($from_row > $to_row) {
589 ($to_row, $from_row) = ($from_row, $to_row);
592 for my $r (($from_row+1)..($to_row-1)) {
593 my $middle_piece = substr($board->[$r], $to_col, 1);
594 return 0 if ($middle_piece ne '-');
600 if (lc($piece) eq 'b') {
601 return 0 unless (abs($from_row - $to_row) == abs($from_col - $to_col));
603 my $dr = ($to_row - $from_row) / abs($to_row - $from_row);
604 my $dc = ($to_col - $from_col) / abs($to_col - $from_col);
606 my $r = $from_row + $dr;
607 my $c = $from_col + $dc;
609 while ($r != $to_row) {
610 my $middle_piece = substr($board->[$r], $c, 1);
611 return 0 if ($middle_piece ne '-');
619 if (lc($piece) eq 'n') {
620 my $diff_r = abs($from_row - $to_row);
621 my $diff_c = abs($from_col - $to_col);
622 return 1 if ($diff_r == 2 && $diff_c == 1);
623 return 1 if ($diff_r == 1 && $diff_c == 2);
627 return (can_reach($board, 'r', $from_row, $from_col, $to_row, $to_col) ||
628 can_reach($board, 'b', $from_row, $from_col, $to_row, $to_col));
631 return (can_reach($board, 'R', $from_row, $from_col, $to_row, $to_col) ||
632 can_reach($board, 'B', $from_row, $from_col, $to_row, $to_col));
636 if ($to_col == $from_col && $to_row == $from_row + 1) {
637 return ($dest_piece eq '-');
639 if (abs($to_col - $from_col) == 1 && $to_row == $from_row + 1) {
640 return ($dest_piece ne '-');
646 if ($to_col == $from_col && $to_row == $from_row - 1) {
647 return ($dest_piece eq '-');
649 if (abs($to_col - $from_col) == 1 && $to_row == $from_row - 1) {
650 return ($dest_piece ne '-');
661 print UCIWRITE "$msg\n";
662 print UCILOG "=> $msg\n";