Essay CPSC233 – Text-Based Strategy Combat Simulator of Ores vs.Elves – Academic Assignment Help

Assignment Task

Full Assignment 
For assignment due dates see the main erid  on the course webpage. New Concepts to be applied for the assignment 
• Implementing a problem involving a ID array of references. 
• Solving a more challenging problem: This assignment will be the first real challenge for some of you. Consequently I’ve created an [extra link) with my editorial and some tips. Also past students have found that completing the exercises that arc part of Problem solving” lecturescan be helpful for solving the more challenging assignments. 
Note: it is not sufficient to just implement a working program and expect full credit. Even if your program is fully working and the design is not as specified in this document (E.g. your program implements static methods other than the main method or only a single class is used) then your marks will suffer greatly. (Your raw grade point is quartered if you do these two things i.e. an ‘A’ becomes a ‘D’ grade). 

There are other crucial design requirements but I used two extreme examples to make a point. You are to learn and practice good Object-Oriented principles in CPSC 233 and you arc expected to be able to apply these principles in higher level courses.

Note: the prohibition on the use of static methods does not necessarily apply to static class constants (e.g. public static final double Pi from class Math is an example of good style, the appropriate use of class constants.) These restrictions apply on to the code that you write and not prewritten code that you may or must for some assignments. 

Overview 
This program consists of an overhead view of a text-based strategy combat simulator of ores vs. elves. Initial positions of the armies will be read from a starting text file (using the prewritten Java classes that have provided). To make it easier to test specific cases the user will specify the name of the input file. After the starting positions have been read into the program it will run on a turn-by-turn basis. Each turn the state of the world will be displayed. After displaying the state the ores and elves will move and then attack the members of the opposing forces. Movement will stop for an individual entity when: I) the edge of the ‘world* is reached 2) an obstacle is encountered (another entity) 3) there is an opposing entity an adjacent square (ores and elves arc in opposition). You need some sensible rules for handling special cases that arise during movement (e.g. don’t move an entity more than once during a turn and multiple entities should not move into the same location during a tum),Casualties who have fallen unconscious (hit points reduced to zero or less) after combat will be removed at the end of the turn. The changes caused by movement and combat will be displayed during the following turn. Before moving onto the next turn the simulation pauses and waits until the user hits enter before moving onto the next turn. The simulation repeats the cycle for each turn until one of the end game conditions has occurred. 
One approach: The entities at the top move and attack before the ones below thementitle. to the left move and attack before those on the right