3 # There are too many chess modules on CPAN already, so here's another one...
11 my ($class, @rows) = @_;
16 $board->[$row][$col] = substr($rows[$row], $col, 1);
29 $nb->[$row][$col] = $board->[$row][$col];
36 # Returns a new board.
38 my ($board, $from_row, $from_col, $to_row, $to_col, $promo) = @_;
39 my $move = _move_to_uci_notation($from_row, $from_col, $to_row, $to_col, $promo);
40 my $piece = $board->[$from_row][$from_col];
41 my $nb = $board->clone();
44 die "Invalid move $move";
47 # white short castling
48 if ($move eq 'e1g1' && $piece eq 'K') {
61 if ($move eq 'e1c1' && $piece eq 'K') {
73 # black short castling
74 if ($move eq 'e8g8' && $piece eq 'k') {
87 if ($move eq 'e8c8' && $piece eq 'k') {
99 # check if the from-piece is a pawn
100 if (lc($piece) eq 'p') {
102 if ($from_col != $to_col) {
104 if ($board->[$to_row][$to_col] eq '-') {
106 $nb->[$to_row + 1][$to_col] = '-';
108 $nb->[$to_row - 1][$to_col] = '-';
112 if (defined($promo) && $promo ne '') {
123 $nb->[$from_row][$from_col] = '-';
124 $nb->[$to_row][$to_col] = $piece;
130 my ($row, $col) = @_;
131 return sprintf("%c%d", ord('a') + $col, 8 - $row);
134 sub _col_letter_to_num {
135 return ord(shift) - ord('a');
138 sub _row_letter_to_num {
139 return 7 - (ord(shift) - ord('1'));
144 $square =~ /^([a-h])([1-8])$/ or die "Invalid square $square";
145 return (_row_letter_to_num($2), _col_letter_to_num($1));
148 sub _move_to_uci_notation {
149 my ($from_row, $from_col, $to_row, $to_col, $promo) = @_;
151 return _pos_to_square($from_row, $from_col) . _pos_to_square($to_row, $to_col) . $promo;
154 sub parse_pretty_move {
155 my ($board, $move, $toplay) = @_;
157 # Strip check or mate
160 if ($move eq '0-0' or $move eq 'O-O') {
161 if ($toplay eq 'W') {
162 return (_square_to_pos('e1'), _square_to_pos('g1'));
164 return (_square_to_pos('e8'), _square_to_pos('g8'));
166 } elsif ($move eq '0-0-0' or $move eq 'O-O-O') {
167 if ($toplay eq 'W') {
168 return (_square_to_pos('e1'), _square_to_pos('c1'));
170 return (_square_to_pos('e8'), _square_to_pos('c8'));
176 if ($move =~ s/=([QRNB])$//) {
180 $move =~ /^([KQRBN])?([a-h])?([1-8])?x?([a-h][1-8])$/ or die "Invalid move $move";
181 my $piece = $1 // 'P';
182 my $from_col = defined($2) ? _col_letter_to_num($2) : undef;
183 my $from_row = defined($3) ? _row_letter_to_num($3) : undef;
184 my ($to_row, $to_col) = _square_to_pos($4);
186 # Find all possible from-squares that could have been meant.
188 if ($toplay eq 'B') {
192 next if (defined($from_row) && $from_row != $row);
194 next if (defined($from_col) && $from_col != $col);
195 next if ($board->[$row][$col] ne $piece);
196 next if (!$board->can_reach($piece, $row, $col, $to_row, $to_col));
198 # See if doing this move would put us in check
199 # (yes, there are clients that expect us to do this).
200 my $check = $board->make_move($row, $col, $to_row, $to_col, $promo)->in_check();
201 next if ($check eq 'both' ||
202 ($toplay eq 'W' && $check eq 'white') ||
203 ($toplay eq 'B' && $check eq 'black'));
205 push @squares, [ $row, $col ];
208 if (scalar @squares != 1) {
209 die "Ambigious or impossible move $move";
211 return (@{$squares[0]}, $to_row, $to_col, $promo);
218 my $str = join('', @{$board->[$row]});
219 $str =~ s/(-+)/length($1)/ge;
223 return join('/', @rows);
227 my ($board, $piece, $from_row, $from_col, $to_row, $to_col) = @_;
229 # can't eat your own piece
230 my $dest_piece = $board->[$to_row][$to_col];
231 if ($dest_piece ne '-') {
232 return 0 if (($piece eq lc($piece)) == ($dest_piece eq lc($dest_piece)));
235 if (lc($piece) eq 'k') {
236 return (abs($from_row - $to_row) <= 1 && abs($from_col - $to_col) <= 1);
238 if (lc($piece) eq 'r') {
239 return 0 unless ($from_row == $to_row || $from_col == $to_col);
241 # check that there's a clear passage
242 if ($from_row == $to_row) {
243 if ($from_col > $to_col) {
244 ($to_col, $from_col) = ($from_col, $to_col);
247 for my $c (($from_col+1)..($to_col-1)) {
248 my $middle_piece = $board->[$to_row][$c];
249 return 0 if ($middle_piece ne '-');
254 if ($from_row > $to_row) {
255 ($to_row, $from_row) = ($from_row, $to_row);
258 for my $r (($from_row+1)..($to_row-1)) {
259 my $middle_piece = $board->[$r][$to_col];
260 return 0 if ($middle_piece ne '-');
266 if (lc($piece) eq 'b') {
267 return 0 unless (abs($from_row - $to_row) == abs($from_col - $to_col));
269 my $dr = ($to_row - $from_row) / abs($to_row - $from_row);
270 my $dc = ($to_col - $from_col) / abs($to_col - $from_col);
272 my $r = $from_row + $dr;
273 my $c = $from_col + $dc;
275 while ($r != $to_row) {
276 my $middle_piece = $board->[$r][$c];
277 return 0 if ($middle_piece ne '-');
285 if (lc($piece) eq 'n') {
286 my $diff_r = abs($from_row - $to_row);
287 my $diff_c = abs($from_col - $to_col);
288 return 1 if ($diff_r == 2 && $diff_c == 1);
289 return 1 if ($diff_r == 1 && $diff_c == 2);
293 return (can_reach($board, 'r', $from_row, $from_col, $to_row, $to_col) ||
294 can_reach($board, 'b', $from_row, $from_col, $to_row, $to_col));
297 return (can_reach($board, 'R', $from_row, $from_col, $to_row, $to_col) ||
298 can_reach($board, 'B', $from_row, $from_col, $to_row, $to_col));
304 if ($to_col == $from_col && $to_row == $from_row + 1) {
305 return ($dest_piece eq '-');
307 if ($to_col == $from_col && $from_row == 1 && $to_row == 3) {
308 my $middle_piece = $board->[2][$to_col];
309 return ($dest_piece eq '-' && $middle_piece eq '-');
311 if (abs($to_col - $from_col) == 1 && $to_row == $from_row + 1) {
312 return ($dest_piece ne '-');
318 if ($to_col == $from_col && $to_row == $from_row - 1) {
319 return ($dest_piece eq '-');
321 if ($to_col == $from_col && $from_row == 6 && $to_row == 4) {
322 my $middle_piece = $board->[5][$to_col];
323 return ($dest_piece eq '-' && $middle_piece eq '-');
325 if (abs($to_col - $from_col) == 1 && $to_row == $from_row - 1) {
326 return ($dest_piece ne '-');
335 # Returns 'none', 'white', 'black' or 'both', depending on which sides are in check.
336 # The latter naturally indicates an invalid position.
339 my ($black_check, $white_check) = (0, 0);
341 my ($wkr, $wkc, $bkr, $bkc) = _find_kings($board);
343 # check all pieces for the possibility of threatening the two kings
346 my $piece = $board->[$row][$col];
347 next if ($piece eq '-');
349 if (uc($piece) eq $piece) {
351 $black_check = 1 if ($board->can_reach($piece, $row, $col, $bkr, $bkc));
354 $white_check = 1 if ($board->can_reach($piece, $row, $col, $wkr, $wkc));
359 if ($black_check && $white_check) {
361 } elsif ($black_check) {
363 } elsif ($white_check) {
372 my ($wkr, $wkc, $bkr, $bkc);
376 my $piece = $board->[$row][$col];
378 ($wkr, $wkc) = ($row, $col);
379 } elsif ($piece eq 'k') {
380 ($bkr, $bkc) = ($row, $col);
385 return ($wkr, $wkc, $bkr, $bkc);
388 # Returns if any side is in mate.
391 my $check = $board->in_check();
392 return 0 if ($check eq 'none');
394 # try all possible moves for the side in check
397 my $piece = $board->[$row][$col];
398 next if ($piece eq '-');
400 if ($check eq 'white') {
401 next if ($piece eq lc($piece));
403 next if ($piece eq uc($piece));
406 for my $dest_row (0..7) {
407 for my $dest_col (0..7) {
408 next if ($row == $dest_row && $col == $dest_col);
409 next unless ($board->can_reach($piece, $row, $col, $dest_row, $dest_col));
411 my $nb = $board->clone();
412 $nb->[$row][$col] = '-';
413 $nb->[$dest_row][$dest_col] = $piece;
414 my $new_check = $nb->in_check();
415 return 0 if ($new_check ne $check && $new_check ne 'both');
421 # nothing to do; mate
425 # Returns the short algebraic form of the move, as well as the new position.
426 sub prettyprint_move {
427 my ($board, $from_row, $from_col, $to_row, $to_col, $promo) = @_;
428 my $pretty = $board->_prettyprint_move_no_check_or_mate($from_row, $from_col, $to_row, $to_col, $promo);
430 my $nb = $board->make_move($from_row, $from_col, $to_row, $to_col, $promo);
431 if ($nb->in_mate()) {
433 } elsif ($nb->in_check() ne 'none') {
436 return ($pretty, $nb);
439 sub _prettyprint_move_no_check_or_mate {
440 my ($board, $from_row, $from_col, $to_row, $to_col, $promo) = @_;
441 my $piece = $board->[$from_row][$from_col];
442 my $move = _move_to_uci_notation($from_row, $from_col, $to_row, $to_col, $promo);
445 die "Invalid move $move";
448 # white short castling
449 if ($move eq 'e1g1' && $piece eq 'K') {
453 # white long castling
454 if ($move eq 'e1c1' && $piece eq 'K') {
458 # black short castling
459 if ($move eq 'e8g8' && $piece eq 'k') {
463 # black long castling
464 if ($move eq 'e8c8' && $piece eq 'k') {
470 # check if the from-piece is a pawn
471 if (lc($piece) eq 'p') {
473 if ($from_col != $to_col) {
474 $pretty = substr($move, 0, 1) . 'x' . _pos_to_square($to_row, $to_col);
476 $pretty = _pos_to_square($to_row, $to_col);
478 if (defined($promo) && $promo ne '') {
487 $pretty = uc($piece);
489 # see how many of these pieces could go here, in all
493 next unless ($board->[$row][$col] eq $piece);
494 ++$num_total if ($board->can_reach($piece, $row, $col, $to_row, $to_col));
498 # see how many of these pieces from the given row could go here
501 next unless ($board->[$from_row][$col] eq $piece);
502 ++$num_row if ($board->can_reach($piece, $from_row, $col, $to_row, $to_col));
505 # and same for columns
508 next unless ($board->[$row][$from_col] eq $piece);
509 ++$num_col if ($board->can_reach($piece, $row, $from_col, $to_row, $to_col));
512 # see if we need to disambiguate
513 if ($num_total > 1) {
515 $pretty .= substr($move, 0, 1);
516 } elsif ($num_row == 1) {
517 $pretty .= substr($move, 1, 1);
519 $pretty .= substr($move, 0, 2);
524 if ($board->[$to_row][$to_col] ne '-') {
528 $pretty .= _pos_to_square($to_row, $to_col);