Description

1. You have to upload your codes in both Canvas and the Judge system at https: //cop3275.cise.ufl.edu
2. For guide on how to access the Judge, visit Judge Access Page under Pages section in Canvas.
3. The judge will run test cases against your code and assign it a grade. You can have multiple submission for the same problem but you have to choose which one is the final (we will consider your final submission for grading). Canvas is only used for record keeping.
4. When uploading on Canvas, zip your programs in a zipfile with your ufid as name (nothing more, just 8 digit ufid, for instance 12345678.zip). Add a .txt extension to all your files. i.e. name your files (inside the zipped archive) p1.c.txt, p2.c.txt, and so on.
5. For all the problems input is read from standard input (e.g. read using scanf) and must be written to standard output (e.g. printf).
6. Don’t print extra stuff. Since the assignments are automatically graded, if the output doesn’t match the expected output, you will not get the points. For instance: If the problem is to read a number and return its square, the expected output is a number (i.e. printf(“%d”,i*i). If you print using something like printf(“square is %d”,i*i); you will not receive any points.
7. The assignment is due on 11:59 pm Friday Nov. 1st, 2019. There is a 20% penalty for late submission of one day. No submission is accepted beyond that time.

Problem 1: Dense!                                                                   [20 Points]

Expected LoC: < 30

For this problem you are given two int arrays of the same length (let’s call them vectors). First compute and print (in a newline) the elementwise multiplication of them. Then determine and print (in a newline) if the given vectors are perpendicular to each other (i.e. if the inner product of them is zero, recall that inner product of vectors is the sum of elementwise multiplication).

Print “perpendicular” if they are perpendicular and “not perpendicular” otherwise (all lowercase). First, N is given as the length of each array. Second, N numbers follow corresponding to first vector and then another N numbers are given for the second vector. N is at most 100,000.

Note that even though each number fits an integer the product may not fit a regular integer. You should properly cast when multiplying the numbers together.

Examples:

Problem 2: Check Mate!                                                        [80 points]

Expected LoC: < 200

In this problem you are given a chess board with pieces on (all formatted as characters). You task is to detect whether the black player is in check, or not threatened at all.

Input is given as 8 lines of 8 characters (8 characters following by ‘\n’ for the first 7 lines, 8 characters for the 8th line). Upper case letters stand for white and lower-case letters stand for black pieces. Don’t assume the input is a proper/complete chess game (e.g. there might be all queens) but there always will be exactly one king of each colour. A hyphen “-“ stands for an empty cell. The output must be the number of opponent (white) pieces that can capture the black king.

You can read the pieces’ moves on Wikipedia (https://en.wikipedia.org/wiki/Chess). In short, all pieces move and capture the same except for Pawn. Rook moves horizontally or vertically, Bishop moves diagonally, Knight has L shaped jumps, Queen moves like both Rook and Bishop, and King can move to its adjacent 8 cells only (a king cannot move to a cell where an opponent can capture it there). Pawn moves straight toward the opponent but can capture the piece on its immediate right or left diagonal cell towards the enemy (that is what matters for checking the king). Assume in our game White starts at the bottom and black starts at the top (so a White pawn can only move up or capture its immediate up-right or up-left piece).

The king is in check, if it is threatened by an enemy piece (i.e., the piece can capture the king). Find and print the number of white pieces that can capture the black king (if no piece threatens the king, then print 0 which means it is not a check situation).

Characters used to denote the pieces are:

White: K = king, Q = queen, R = rook, B = bishop, N = knight, P = pawn

Black: k = king, q = queen, r = rook, b = bishop, n = knight, p = pawn

Hints:

• Implement functions that reverse track the moves from the king until it reaches the first piece. That piece can attack the king if it’s capture move matches with the move that you tracked. e.g., a function that checks the whole row and column starting at king’s location and moving away until it reaches a piece; if that piece is Queen or Rook then it can capture the king.
• Read input properly. Remember scanf characteristics with characters and whitespaces (newlines). Store in a two-dimensional array.
• Always bound check the indices of the arrays.

Examples:

Problem 3: CHECKMATE!                                        [Extra 40 points]

Expected LoC: 400

If the king is in check and the player doesn’t have any move to get the king out of the check, it is checkmate and the player loses the match. A king may get out of the check by either moving out of the threatened cell (into a non-threatened one, potentially capturing the enemy attacker) or if another piece blocks the way of the opponent’s piece that can capture the king (or knocks out the opponent’s piece that is threatening the king). Note that the king might be threatened by two opponent pieces (more than one piece in general). In that case the only valid move is for the king to move to a non-threatened cell (and if it doesn’t have such a move, then it is checkmate).

Implement checkmate functionality. Input is same as before. Output is same as before, except when it is a checkmate, print 100. i.e. the example (with the picture above) is a case of checkmate. In this case you print 100 instead of 1. It is a checkmate because the attacking queen is being supported by a rook which means the king cannot capture the attacking queen (a king cannot move to a cell where it can be captured, in this case by the supporting rook).

1. Note: this extra credit problem is substantially harder than problem 2 as you need to implement all the possible moves/captures for black player and all the captures for white player.
2. In all cases if the king can move to a non-threatened cell, it is not a checkmate.
3. You need to check if it is a single check (only one white piece can capture the king), if any black piece can block the attacking piece or capture it (if it can, it is not a checkmate). If the king cannot move to a non-threatened cell and if no other black piece can help, it is a checkmate and black loses the game.
4. If it is a multi-check (more than one piece can capture the black king), the only possible way to get out of check is for the king to move to a cell where no other piece can capture it.

Note: do not attempt this problem unless you have already done problem 2 and you have excessive free time on your hand!

Note 2: You need to pass at least 97 test cases for a partial credit (97 gives you 10 points, 98 gives you 20, 99 gives you 30 and 100 will give you 40 points). There is no partial credit for this problem below that.