Loading...

Messages

Proposals

Stuck in your homework and missing deadline? Get urgent help in $10/Page with 24 hours deadline

Get Urgent Writing Help In Your Essays, Assignments, Homeworks, Dissertation, Thesis Or Coursework & Achieve A+ Grades.

Privacy Guaranteed - 100% Plagiarism Free Writing - Free Turnitin Report - Professional And Experienced Writers - 24/7 Online Support

Java program

21/09/2020 Client: papadok01 Deadline: 24 Hours

Objectives: Create a Java program using programming fundamentals (file I/O, loops, conditional statements, arrays, functions)


Problem: In an effort to win a coding competition, you decided to create an awesome Obstacle Warrior game. The game is played on a 2-dimensional board similar to a Chess board, but the dimensions may be different. The minimum size of the board is 2x2. The board will have a Start square and an Exit square that are not stored on the board. Start and Exit squares cannot be the same. Other board squares may contain obstacles in the form of an integer that will define how the warrior position and score will be affected. The obstacle squares can have values from 0 to -10 only. The Start square is always a clear square. All clear squares are marked with # on the board. The Exit square may contain an obstacle that is not a zero. The size of the board, number of obstacles, and Start and Exit squares are all unknow to your code prior to running. This information is stored in a file that your code will read at the beginning of the game. The board.dat file must be read into a 2-D array.


A warrior must start at the Start square and find their way to the Exit square. The warrior can move on the board in any direction including diagonally, one square at a time. A warrior has a running score (integer) maintained from the start of the game until the warrior exits the board. If the warrior lands on an obstacle square with a value of zero, the warrior is sent back to the starting position and the obstacle square will become a normal square (obstacle removed). If the obstacle square has a negative number, that number will reduce the warrior's score by the value of the obstacle, and the obstacle square will become a clear square (obstacle removed). Each VALID move that the warrior makes without landing on an obstacle will earn the warrior one point. The moves for the warrior are randomly generated by your code in the form of a direction (0-UP, 1-DOWN, 2-LEFT, 3-RIGHT, 4-UPRIGHT, 5-DOWNRIGHT, 6-UPLEFT, 7-DOWNLEFT). If the warrior is at the boundary of the board and your code generates an invalid move, that move will be ignored. Your code will keep generating moves until the warrior exits at the Exit square. Once the warrior exits, your program will store the updated board information to a new file ResultBoard.dat as single-space separated data. The program will also display the total number of valid moves, the total time elapsed in milliseconds since the first move until the warrior exited the board, the final score of the warrior and the formatted board information (right aligned columns with total of 5 spaces).


Output Format:



  • Each column in the final board display must be of total width of 5 spaces

  • Data in each column must be right aligned


Enter the board data file path: C:\board.dat //Repeat prompt until valid file OR show error and exit.

Type "Start" to start the game or "Exit" to exit the game: exit //Your program must exit

Enter the board file path: C:\board.dat

Type "Start" to start the game or "Exit" to exit the game: start //You may display the moves and the running score after each move but it is not required

The warrior made 270 valid moves in 503 milliseconds. The final score is 175 points.



   #    #    #    #    #

   #    #    #    0    #

   #    #    #    #    #

   #   -3    #    #   -4

   #    #    #    #    #



Press any key to exit!


Program Structure: Your code should be modular and easy to understand. In addition to the main method, the following methods are required to be in your code. These methods will be used by the unit testing to test the accuracy of your code.


public static String[][] ReadBoardFromFile(String fileName, Position startPosition, Position exitPosition)

public static boolean WriteBoardToFile(String fileName, String[][] boardArray)

public static int GenerateDirection()

public static boolean MoveWarrior(int direction, String[][] boardArray, Position currentPosition)

public static int CalculateWarriorScore(int currentScore, Position currentPosition, String[][] boardArray)

public static String DisplayResults(int currentScore, int numberOfMoves, int timeElapsed, String[][] boardArray)


Program Flow:



  • Program starts in main() method

  • Prompt user for Board.dat file path

  • Read board from file

  • Generate a direction

  • Move the warrior

  • Calculate new score

  • Check conditions and clear square if needed

  • Repeat until the warrior is at the exit square

  • Display the results

  • Prompt user to exit game


Board.dat file format:



  • The data in the file will be separated by one space

  • Assume that all data in the file is valid

  • Clear and Start squares (no obstacles) will be marked with # in the file

  • The first line of the file contains the dimensions of the board (rows and columns) e.g. 3 7

  • The second line contains the Start square indexes (rowIndex, columnIndex)

  • The third line contains the Exit square indexes (rowIndex, columnIndex)

  • The rest of the lines represent the contents, including obstacles, of a row on the board

  • Example of a Board size 5x5 data file:


5 5

2 2

4 3

# -5 # # #

# # # 0 #

# # # # #

# -3 # # -4

-10 # # # #


**ResultBoard.dat file format: **



  • Data must be separated by a single space


# # # # #

# # # 0 #

# # # # #

# -3 # # -4

# # # # #


Grading:



  • Coding standards, style and comments (10 Points)

  • Unit testing methods x6, one for each of the methods mentioned above (10 Points)

  • ReadBoardFromFile (10 Points)

  • WriteBoardToFile (10 Points)

  • GenerateDirection (10 Points)

  • MoveWarrior (20 Points)

  • CalculateWarriorScore (20 Points)

  • DisplayResults (10 Points)


Unit Test


package ObstaclesWarrior;


import static org.junit.Assert.assertArrayEquals;


import static org.junit.Assert.assertEquals;


import static org.junit.Assert.assertTrue;


import java.io.File;


import java.io.PrintWriter;


import org.junit.Test;


/**


* Unit test


*/


public class MainTest {


@Test


public void ReadBoardFromFileTest()


{


final String FILE_NAME = "Board.dat";


//Either dynamically create the Board.dat file or assume it already exists


/*File file = new File(FILE_NAME);


PrintWriter printToFile = new PrintWriter(file);


printToFile.println("4 4");


printToFile.println("0 2");


printToFile.println("2 2");


printToFile.println("0 # # #");


printToFile.println("# -3 # -5");


printToFile.println("# # # #");


printToFile.println("# # -1 #");


printToFile.close();


*/


//Create start and exit positions to pass to the method.


//These objects will be set with actual values from the


//board file by your code inside the ReadBoardFromFile() method


Position actualStartPosition = new Position(0, 0);


Position actualExitPosition = new Position(0, 0);


//These are the expected values for the start and exit postions


Position expectedStartPosition = new Position(0, 2);


Position expectedExitPosition = new Position(2, 2);


//Create the expected array with the data


String[][] expectedBoardArray = {


{"0", "#", "#", "#" },


{"#", "-3", "#", "-5" },


{"#", "#", "#", "#" },


{"#", "#", "-1", "#" },


};


//Invoke the ReadBoardFromFile() method and capture the returned array


String[][] actualBoardArray = Main.ReadBoardFromFile( FILE_NAME,


actualStartPosition,


actualExitPosition);


//Check if the start and exit positions match   


if((expectedStartPosition.getX() != actualStartPosition.getX())||


(expectedStartPosition.getY() != actualStartPosition.getY()))


{


assertTrue("Start position does not match", false);


}


if((expectedExitPosition.getX() != actualExitPosition.getX())||


(expectedExitPosition.getY() != actualExitPosition.getY()))


{


assertEquals("Exit position does not match",false);


}


//Compare the actualBoardArray with the testBoardArray.


//Size and data must match.


//Make sure the number of rows match


assertArrayEquals("Board array read from file does not match expected array",


expectedBoardArray,


actualBoardArray );


}


@Test


public void WriteBoardToFileTest()


{


}


@Test


public void GenerateDirectionTest()


{


}


@Test


public void MoveWarriorTest()


{


}


@Test


public void CalculateWarriorScoreTest()


{


}


@Test


public void DisplayResultsTest()


{


}   


}


Main.java


package ObstaclesWarrior;


/**


* ObstaclesWarrior


*


*/


public class Main


{


public static void main( String[] args )


{


}


public static String[][] ReadBoardFromFile(String fileName,


Position startPosition,


Position exitPosition)


{


//This code was added just to enable you to run the provided unit test.


//Replace this code with your own code.


String[][] gameBoard = {


{"0", "#", "#", "#"},


{"#", "-3", "#", "-5"},


{"#", "#", "#", "#"},


{"#", "#", "-1", "#"},


};


startPosition.setX(0);


startPosition.setY(2);


exitPosition.setX(2);


exitPosition.setY(2);


return gameBoard;


}


public static boolean WriteBoardToFile(String fileName,


String[][] boardArray)


{


return true;


}


public static int GenerateDirection()


{


return 0;


}


public static Boolean MoveWarrior(int direction,


String[][] boardArray,


Position currentPosition)


{


return true;


}


public static int CalculateWarriorScore(int currentScore,


Position currentPosition,


String[][] boardArray)


{


return 0;


}


public static String DisplayResults(int currentScore,


int numberOfMoves,


int timeElapsed,


String[][] boardArray )


{


return "";


}


}


Position.java


package ObstaclesWarrior;


/**


* Position


*/


public class Position {


private int x;


private int y;


public Position(int xValue, int yValue) {


x = xValue;


y = yValue;


}


public int getX() {


return x;


}


public void setX(int x) {


this.x = x;


}


public int getY() {


return y;


}


public void setY(int y) {


this.y = y;


}


}

Homework is Completed By:

Writer Writer Name Amount Client Comments & Rating
Instant Homework Helper

ONLINE

Instant Homework Helper

$36

She helped me in last minute in a very reasonable price. She is a lifesaver, I got A+ grade in my homework, I will surely hire her again for my next assignments, Thumbs Up!

Order & Get This Solution Within 3 Hours in $25/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 3 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

Order & Get This Solution Within 6 Hours in $20/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 6 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

Order & Get This Solution Within 12 Hours in $15/Page

Custom Original Solution And Get A+ Grades

  • 100% Plagiarism Free
  • Proper APA/MLA/Harvard Referencing
  • Delivery in 12 Hours After Placing Order
  • Free Turnitin Report
  • Unlimited Revisions
  • Privacy Guaranteed

6 writers have sent their proposals to do this homework:

Smart Homework Helper
Assignment Hub
Top Academic Guru
Ideas & Innovations
Writing Factory
University Coursework Help
Writer Writer Name Offer Chat
Smart Homework Helper

ONLINE

Smart Homework Helper

Greetings! I am the professional electrical, telecom engineer, rich experience in QPSK, OFDM, FFT, such signal processing concetps with matlab, I can satisfy you definitely. more in chat.thanks.

$55 Chat With Writer
Assignment Hub

ONLINE

Assignment Hub

I feel, I am the best option for you to fulfill this project with 100% perfection. I am working in this industry since 2014 and I have served more than 1200 clients with a full amount of satisfaction.

$55 Chat With Writer
Top Academic Guru

ONLINE

Top Academic Guru

This project is my strength and I can fulfill your requirements properly within your given deadline. I always give plagiarism-free work to my clients at very competitive prices.

$35 Chat With Writer
Ideas & Innovations

ONLINE

Ideas & Innovations

Hi, Hope you are doing well. I can do this easily because I have several experiences to write articles on different web sites, creative content for several blogs & also SEO writing. Even I have written many kindle ebooks, Being a creative writer, I think I am the most eligible person for your Ghostwriting project. So lets make no longer delay & start chatting immediately.

$60 Chat With Writer
Writing Factory

ONLINE

Writing Factory

I can help you with creating a presentation of one slide for The Word of William Hunter. I will be happy to offer you 100% original work with high-quality standard, professional research and writing services of various complexities.

$25 Chat With Writer
University Coursework Help

ONLINE

University Coursework Help

Greetings! I’m very much interested to write for attendance systems. I am a Professional Writer with over 5 years of experience, therefore, I can easily do this job. I will also provide you with TURNITIN PLAGIARISM REPORT. You can message me to discuss the details.

$40 Chat With Writer

Let our expert academic writers to help you in achieving a+ grades in your homework, assignment, quiz or exam.

Similar Homework Questions

Writing assignment 1 - Usted: la computadora suya; la suya - Who built the georgia guidestones - 3 types of micrometers - The market supply curve for labor is upsloping because - Who led the first voyage around the world - Business Finance Discussion - Seven step decision model - Apa essay compare and analyze - Pr firms often raid news staff for talent because - Chaos theory portfolio algebra 2 answers - Major components of holistic marketing - Peter pan and wendy play script pdf - James squire ginger beer dan murphys - Dobbs company issues two year bonds - Nmap is a type of vulnerability scanner - Operations management simulation inventory basics answers - Ethical Problems Case Study - 3rd essay ENG102 WP2 FINAL 3000 words essay - Is 44 a prime or composite number - Kings and queens lyrics horrible histories - John fairfax publications v rivkin - Grammar boot camp worksheets - Advanced higher chemistry course specification - Https mail yahoo com mb src ym&reason myc - Social Work- Safety and Agency Responsibility - Regular practices of the jains include - 4-5 slides - Do artifacts have politics summary - Sacred destination presentation - Studying sn1 and sn2 reactions nucleophilic substitution lab report - A3 vs a1 paper size - Www graphpad com quickcalcs ttest1 cfm - Complexity and Information Systems Research in the Emerging Digital World. - Nambour swap meet 2020 - Maximum zs for tt - Assembly of confessing congregations - Norman bowker the things they carried - Nouns ending in ity - Why is macbeth unlucky - Proper planning prevents poor performance - Global Cities - Ammonium hydrogen sulfide decomposes according to the following reaction - Current voltage and resistance worksheet answers - Art dicussion 3 - The political capital of the northern tribes was at - Primary activities and secondary activities - Uses of metals worksheet - 2.09 m in feet - Inanimate environment service marketing - The british airways swipe card debacle case study - HED 132 FINAL (250 POINTS) - Strong thesis statement about technology - Week 5 part 1 plagiarism free - Checking out me history poem - Ex 9 8 aging of receivables schedule - Royal melbourne hospital pharmacy - Analyzing an Organizational or Corporate Narrative - Sulfamic acid grout cleaner home depot - Call of the wild author - 8week6 Indiv - Ingestion of bleach icd 10 - Why did the pilgrims owe squanto gratitude - Matlab switch case range - Basic matrix operations worksheet answers - Advantages and disadvantages of training methods ppt - Market mapping bbc bitesize - A subject guide is course hero - Two stage cmos op amp - Factoring special cases trinomials - Chamberlain college of nursing nj address - Muscle fatigue and atp production lab answer key - Bond university compliance handbook - Brave and startling truth - How to insert image to html - Character study graphic organizer - Just a dream chris van allsburg activities - Fundamentals of organizational behaviour pdf download - NEED IN 12 HOURS or LESS - Critical bounty research help creature capture - Journal from problem to persuasion graded - Blue ocean strategy summary - Legal issues in nursing practice - Theories of personality schultz 11th edition apa citation - Ebay inc 2009 case study - Select an organization that has a Global platform - Discussion - An ideal otto cycle has a compression - Taboo delicacies - Xcode address book - Research Assignment - Peasants and artisans in japan - Timbuk2 case study answers - S&l dental hoboken nj 07030 - Why does sheldon knock three times - Bye bye bus driver - Find v0 and i0 in the circuit - Kennesaw state course catalog - Itp loop model - Message passing in os