#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define BOARD_SIZE 8
#define EMPTY 0
#define PAWN 1
#define KNIGHT 2
#define BISHOP 3
#define ROOK 4
#define QUEEN 5
#define KING 6

/**
* For the sake of simplicity, you can store this table in a static or
* external 2D array of integers in your program.
*/
static int table[BOARD_SIZE][BOARD_SIZE];
void setup();
void show();

int isLegalLetter(char letter);
int isLegalNumber(int number);
int isLegalInput(char a, int b);

int getPiece(int col, int row);

int pawnMoves(int col, int row, int * rows, int * cols);

int knightMoves(int col, int row, int * rows, int * cols);

int bishopMoves(int col, int row, int * rows, int * cols, int size);

int rookMoves(int col, int row, int * rows, int * cols, int size);
int queenMoves(int col, int row, int * rows, int * cols, int size);
int kingMoves(int col, int row, int * rows, int * cols);

int isOnBoard(int c, int r);
void validatePosibleMoves(int * rows, int * cols, int size);
int possibleMoves(int col, int row, int * rows, int * cols);
void mv(char a0, int b0, char a1, int b1);

int pawnCaptures(int col, int row, int * rows, int * cols);

int knightCaptures(int col, int row, int * rows, int * cols);

int bishopCaptures(int col, int row, int * rows, int * cols, int size);

int rookCaptures(int col, int row, int * rows, int * cols, int size);
int queenCaptures(int col, int row, int * rows, int * cols, int size);
int kingCaptures(int col, int row, int * rows, int * cols);
void validatePosibleCaptures(int piece, int * rows, int * cols, int size);
int possibleCaptures(int col, int row, int * rows, int * cols);
int cp(char a0, int b0, char a1, int b1);

/*
*
*/
int main(int argc, char** argv) {
setup();
show();
int result = 0;
char * buffer;
size_t bufsize = 32;
size_t characters;
char a0;
int b0;
char a1;
int b1;
char cmd[5];
buffer = (char *)malloc(bufsize * sizeof(char));
do {
   // get input
   printf("Enter the command: ");
   characters = getline(&buffer, &bufsize, stdin);
   buffer[characters - 1] = '\0';

   // first case
   if (strcmp(buffer, "show") == 0) {
         show();
   } else {
         // split string
         sscanf(buffer, "%s %c%d %c%d", cmd, &a0, &b0, &a1, &b1);
         if (strcmp(cmd, "mv") == 0) {
            mv(a0, b0, a1, b1);
         } else if (strcmp(cmd, "cp") == 0) {
            result = cp(a0, b0, a1, b1);
         }
   }

} while (result == 0);

if (result > 0) {
   printf("White wins\n");
} else {
   printf("Black wins\n");
}

free(buffer);
return (EXIT_SUCCESS);
}

/**
* capture a piece
* @param a0
* @param b0
* @param a1
* @param b1
* @return
*/
int cp(char a0, int b0, char a1, int b1) {
if (isLegalInput(a0, b0) == 0) {
   printf("Invalid %c%d\n", a0, b0);
   return 0;
}

if (isLegalInput(a1, b1) == 0) {
   printf("Invalid %c%d\n", a1, b1);
   return 0;
}

int r0 = b0 - 1;
int c0 = a0 - 'a';
int piece = getPiece(c0, r0);
if (piece == EMPTY) {
   printf("There isn't any piece at %c%d\n", a0, b0);
   return 0;
}
int r1 = b1 - 1;
int c1 = a1 - 'a';
int dest = getPiece(c1, r1);
if (dest == EMPTY) {
   printf("There isn't any piece at %c%d\n", a1, b1);
   return 0;
}
int rows[BOARD_SIZE * BOARD_SIZE];
int cols[BOARD_SIZE * BOARD_SIZE];

Introduction Dijkstraâ€™s Algorithm For this assignment, you will...