Project 2 CSC-171 Skyscraper Puzzle 3/9/2021 1 Problem Imagine a city block of skyscrapers whose area is surrounded by streets. Skyscrapers of various heights are evenly distributed into the rows and...

1 answer below »
Need homework helper


Project 2 CSC-171 Skyscraper Puzzle 3/9/2021 1 Problem Imagine a city block of skyscrapers whose area is surrounded by streets. Skyscrapers of various heights are evenly distributed into the rows and columns of the block. A skyscraper puzzle is one where you are asked to organize the skyscrapers into a valid configuration that meets all the criteria for the puzzle. 1.1 Puzzle Details These game rules, along with sample puzzles, can be found at: http://www.brainbashers.com/skyscrapershelp.asp Figure 1: Skyscraper Rules 1 Figure 2: Skyscraper ”Clues” or ”Looking Values” Figure 3: Skyscraper Puzzle Solution 1.2 Warmup Try to solve the puzzle in the figure below – this part is just for fun! 2 2 Project Requirements Although it would be a very fun exercise to write a program to solve skyscraper puzzles, for this project you are only asked to write a program to verify solutions. You should design a Skyscraper class, with private variables representing the state (i.e., the board configuration) as well as the following methods: 1. public boolean verifyPlacement() – this method should return true if the place- ment is valid (i.e., every row and every column contains each number exactly once.). Otherwise, this method should return false. 2. public void loadPuzzle() – this method should read a puzzle from standard input in the format specified below. This method must update the relevant instance variables for the object. 3. public void print() – this method should print the puzzle to standard output fol- lowing the format specified below. 4. public void printWithVisibility() – this method should print the puzzle along with the visibility scores on the outside. 5. A very simple main method which loads the puzzle from the user, then checks validity and prints the result. If it’s valid, it also prints the puzzle with visibility. Continued on next page. 3 2.1 Input and Output Format The loadPuzzle() method reads the configuration from standard input. This is the format of the input and the required output for basic printing: 1. The first line contains the square dimension of the board, DIM, as a single integer. 2. The remaining DIM lines will each contain exactly DIM positive integers, separated by a single space, but with no trailing space after the last integer. These lines represent the heights of the skyscrapers in the same layout as the puzzle. 3. All subsequent lines should be ignored. For example, the puzzle in Figure 3 is described by the input: 4 4 3 2 1 1 4 3 2 3 2 1 4 2 1 4 3 2.1.1 printWithVisibility Format The printWithVisibility method should output a graphical representation of the puzzle, along with the visibility scores calculated according to the rules described earlier. For the puzzle in Figure 3, the output of this method should be: 1 2 3 3 ------- 1|4 3 2 1|4 2|1 4 3 2|3 2|3 2 1 4|1 2|2 1 4 3|2 ------- 3 3 1 2 2.2 Design and Documentation You are required to have exactly the public methods described in this document. You are also encouraged (but not required) to have helper methods. (These may be particularly helpful when verifying the puzzle and when calculating visibility.) All your helper methods should be declared private. If you have any class variables, they must be declared private as well. Because it complicates grading, you are not allowed to have any package declarations. In- cluding package declarations in your submission will cause you to lose points. As with all Java programs, your program filename must match the public class exactly, therefore your program must be named Skyscraper.java and your class name must be named Skyscraper. 4 Please include a readme in this submission which describes the state of your code. If every- thing works, you can simply write that everything works. Otherwise, describe what does and does not work when you submit it. Your readme should be plain text – no docx, rtf, or pdf files please. 3 Grading Your grade for this assignment will be based on the following criteria: • 25% verifyPlacement • 20% loadPuzzle • 10% basicPrint • 25% printWithVisibility • 10% Design and Documentation. 3.1 Submission Zip your solution program, Skyscraper.java, and a readme file and into a zip file named skyscraper_USERNAME.zip, where USERNAME is replaced with your actual username. This will help us to efficiently grade your submissions. Submit your zip file to Blackboard before April 1 2021 at 1159PM. 5
Answered 1 days AfterMar 14, 2021

Answer To: Project 2 CSC-171 Skyscraper Puzzle 3/9/2021 1 Problem Imagine a city block of skyscrapers whose...

Vibhav answered on Mar 16 2021
152 Votes
Skyscraper/1.JPG
Skyscraper/Skyscraper.java
Skyscraper/Skyscraper.java
import java.util.Scanner;
import java.util.*;
public class Skyscraper {
    private int[][] b
oard;
    //Visibility
    private int[] up;
    private int[] down;
    private int[] left;
    private int[] right;

    Skyscraper(){
        board = null;
        up = null;
        down = null;
        left = null;
        right = null;
    }

    private void findVisibility() {
        //From up
        for(int j=0; j            int count = 1;
            int max = board[0][j];
            for(int i=1; i                if(board[i][j] > max) {
                    max = board[i][j];
                    count++;
                }
            }
            up[j] = count;
        }
        //From down
        for(int j=0; j            int count = 1;
            int max = board[board.length-1][j];
            for(int i=board.length-2; i>=0; i--) {
                if(board[i][j] > max) {
                    max = board[i][j];
                    count++;
                }
            }
            down[j] = count;
        }
        //From left
        for(int i=0; i            int count = 1;
            int max = board[i][0];
            for(int j=1; j                if(board[i][j] > max) {
                    max = board[i][j];
                    count++;
                }
            }
            left[i] = count;
        }
        //From right
        for(int i=0; i
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here