2D Array Question

Question

There is a 2D-rectangular MxN Terrain. On each square of the terrain, there may or may not be some gold and a Monster. Each monster has a name and damage (a numeric value between 1- 10). Some Heroes are traversing on the terrain. Each Hero has a name, health (a numeric value between 0-100), and a wallet that contains the golds he has collected. When a hero steps onto a square on the terrain, first he collects all of the golds placed on that square. Then, If there is a monster on the current square, Hero must fight with the monster and kill it. This fight decreases Hero’s health by the monster’s damage. If the Hero’s health drops below 0 after the battle, both Hero and monster die, and his/her golds disappear. When two or more heroes step on the same square simultaneously, the one with more health survives, and the other Hero dies. If there is gold on the square, the surviving Hero collects the gold. If there is a monster on the same square, the surviving Hero fights with the monster. At each turn, each Hero is moving one step randomly in one of 4 directions (i.e., up, down, left, right) Model the scenario above in OOP Main class has only the main () function. In the main, read the input file create the terrain and heroes accordingly. Simulate the terrain for a given number of turns (Ask the user to read from the keyboard). Print out the terrain, the positions, and the golds of each hero and monster at each turn. Also, print out any fights happening at each turn.

Terrain Info

5 / M

4 / N

0 0 1 2 / number of golds at each position in the terrain

2 3 4 1

1 1 0 0

0 2 2 1

2 1 1 0

Monster info

2 / number of monsters

0 2 Monster1 2 / row col name damage

3 1 Monster2 5

Hero info

1 / number of heroes

1 2 Hero1 100 / row col name health

Answer 1

Either you or someone else has already posted this project,

which is WAY TOO BIG and WAY TOO COMPLICATED to be posted here.

The long term final result is

xMax - (x1+x2+x3 + ... xn) where

xMax is the greatest strength owned by the hero and

x1,x2,..xN are the strength values of the other monsters and heros..

For example:

Hero1: 1500

Hero2 : 800

Monster 1: 10

Monster 2: 5

then the winner shall be Hero 1 with strength value =

1500 - (800+10+5) =

1500 - 815 =

685

This is because they will eventually collide and when they due,

the strength values will cancel, leaving the largest value minus

these differences.

From the OOP standpoint, I would suggest the following:

Base class called Player or GameCharacter

with data members strength value and name.

Monster inherits directly from GameCharacter with no additional

data members

Hero inherits from GameCharacter with an additional data member

for the # of gold pieces.

The GAME board is a 2-D array of ArrayList<GameCharacter>

That is, each cell in the game board is, in and of itself,

is an ArrayList which contains an GameCharacter objects (typecast

as either Hero or Monster)

I believe I may have some code lying around, so shoot me an email.