logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

COP3502 GatorRaider Project

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

pdf file attached and github base code link is on the first page of the pdf

 

x

COP3502

GatorRaider Project

Overview

This project will provide students with practice working with inheritance and polymorphism in programming

languages. “GatorRaider” is a game whose play and levels are based on Ms. Pac-Man. In this game, four defender

characters (other lousy mascots) attempt to limit the damage by an attacker character (gator). Each student will

be building a controller for the attacking character. This controller will have the following specification which

students are required to follow (which is already done for you):

Package: edu.ufl.cise.cs1.controllers

Class Name: StudentAttackerController

Implements: AttackerController

Getting the Code Base

This project requires students to work in an existing code base. You will need to download the project from the

Git repository on GitHub, using the following URL to clone the repository:

https://github.com/robertcasanova99/gatorraider

Game Mechanics

In this game, the attacker is attempting to cover as much of the terrain as possible, while the defenders attempt to

limit the terrain covered by the attacker. The play occurs in two distinct modes: Normal and Vulnerable.

Normal Mode

In Normal Mode, the attacker tries to cover terrain while avoiding the defenders. If any defender reaches the

attacker, the attacker dies and loses a life, starting at the initial location once again.

Vulnerable Mode

If the attacker reaches a power pill, the mode changes for a limited time to Vulnerable Mode. In Vulnerable

Mode, if the attacker reaches any defender, the defender will die and its “soul” will return to the lair, where it

will regenerate. Each power pill, once consumed, is gone until the level changes.

Scoring

For every new location the attacker reaches, the attacker will score points. In addition, attacker receives a bonus

for reaching the power pills and for killing defenders. The goal of defenders is to limit the score of the attacker.

Project Structure

This code base makes use of the Model-View-Controller (MVC) software pattern:

The Data Itself

Shows Users the Data Modifies the Data

In this application, the interfaces in the game.models package define the format and arrangement of information

about the game state. The game start is displayed to the user via the GameView class, which draws the game level

and game actors to the screen. The behavior of the actors is determined by implementations of the

AttackerController and DefenderController, whose actions change the how the game plays out.

Student Work

Students will design, implement, and test the attacker controller, and evaluation will include consideration of

performance and documentation.

AttackerController Interface

Students must implement the AttackerController interface by providing the following methods:

public void init(Game game)

This method is called once when the game begins. (For some controllers this method may be empty.)

public int update(Game game, long time)

Called to update the agent, given game state game after time milliseconds have passed. This method returns a

direction for the attacker which will be used to move the attack in the next game tick.

public void shutdown(Game game)

Called once at the end of the game for cleanup. (For some controllers this method may be empty.)

General Requirements

The StudentAttackerController submission must meet the following criteria:

1) The controller must use information from the attacker’s state in making decisions.

2) The init() and shutdown() methods may be optionally left empty.

3) The attacker’s behavior may not be random.

Model

Game Objects

View

Level Display

Controller

StudentAttackerController

Game State

Following is a summary of the most important classes and methods that are a part of the game state and can be

used to determine the next action. NOTE: this is not an exhaustive list; please see source code for full information.

Game Interface

A class implementing the Game interface represents a game state.

List<Node> getPillList()

Get a list of all available pills in the current level.

List<Node> getPowerPillList()

Get a list of all available power pills in the current level.

boolean checkPill(Node location)

Returns true if the location in question holds an available pill.

boolean checkPowerPill(Node location)

Returns true if the location in question holds an available power pill.

Attacker getAttacker()

Returns a copy of the attacker’s actor object.

Defender getDefender(int whichDefender)

Returns a copy of the defender’s actor object specified (by number).

List<Defender> getDefenders()

Retrieves a list of a copy of each defender’s actor object.

Game copy()

Return a deep copy of this game state object.

Maze getCurMaze()

Returns a copy of the current maze information

class Direction { public static final int UP, RIGHT, DOWN, LEFT, EMPTY }

Class containing constants for directions.

Node Interface

A class implementing the Node interface represents a location in the terrain. It has coordinates and neighbors.

int getX()

Returns the x-coordinate of this location.

int getY()

Returns the y-coordinate of this location.

boolean isPill()

Returns true if this location has or had a pill.

boolean isPowerPill()

Returns true if this location has or had a power pill.

boolean isJunction()

Returns true if this location is a fork (has 3 or more neighbors).

int getNumNeighbors()

Returns the number of neighbors this location has.

Node getNeighbor(int direction)

Returns the node neighboring this location in the direction specified.

List<Node> getNeighbors()

Returns the nodes neighboring this location as a List.

int getPathDistance(Node destination)

Returns the distance of the shortest path between this location and the destination.

Maze Interface

A Maze object, representing the terrain, has the following methods:

Node getInitialAttackerPosition()

Returns the starting location of the attacker.

Node getInitialDefendersPosition()

Returns the starting location of the defenders.

List<Node> getPillNodes()

Returns a list of the Node objects where pills are.

List<Node> getPowerPillNodes()

Returns a list of the Node objects where power pills are.

List<Node> getJunctionNodes()

Returns a list of the Node objects that are forks (have 3 or more neighbors).

Actor Interface

The Actor interface defines methods that are common to all characters (attackers and defenders alike).

Node getLocation()

Returns the current location of the actor.

int getDirection()

Returns the direction that the actor is currently facing.

List<Node> getPathTo(Node destination)

Returns a list of nodes defining a path between the current location and the destination.

int getNextDir(Node target, boolean approach)

Returns the next direction the actor should move it to approach (if approach is true) or flee (if false) the target.

int getReverse()

Return the direction that is the reverse of where the agent is currently facing.

Node getTargetNode(List<Node> targets, boolean nearest)

Given a list of targets, find the closest (if nearest is true) or furthest (if false) from the actor.

Actor getTargetActor(List<Actor> targets, boolean nearest)

Given a list of actors, find the closest (if nearest is true) or furthest (if false) from the actor.

Void addPathTo(Game game, Color color, Node node)

Adds a visual path of the user’s choice of color from the actor to a specific node. An example of its usage is

provided in the default StudentAttackerController file.

Attacker Interface

An Attacker object, representing the attacker’s actor, provides the following methods:

List<Integer> getPossibleDirs(boolean canReverse)

Returns a list of potential directions that the agent could move in. If canReverse is true, this can include the

direction opposite the one the agent is currently facing.

List<Node> getPossibleLocations(boolean canReverse)

Returns a list of potential locations that the agent could move to from its current location. If canReverse is

true, this can include the location in the direction opposite the one the agent is currently facing. The list will

always be of size 4, but if the attacker cannot move somewhere the direction’s index in the list

(list.get(direction)) will be null.

Defender Interface

A Defender object, representing a defender’s actor, provides the following methods:

boolean isVulnerable()

Returns true if the defender is in a vulnerable state.

boolean requiresAction()

Returns true if the actor currently requires an action to properly continue functioning (due to junction, etc.)

int getVulnerableTime()

Returns the amount of time left that the actor will be vulnerable.

int getLairTime()

Returns the amount of time remaining that the actor will spend in the lair.

List<Integer> getPossibleDirs()

Returns a list of potential directions that the agent could move in, excluding the direction opposite the one the

actor is currently facing.

List<Node> getPossibleLocations()

Returns a list of potential locations that the agent could move to from its current location, excluding the location

in the direction opposite the one the agent is currently facing.

Configurations

In the top right corner (if you are using Intelli-J) you can find a drop-down of all the configurations which

appear as such:

Example – Visual: Visual gameplay of the example implementation of StudentAttackerController .

Human – Visual: Visual gameplay that can be controlled with arrow keys.

TestAgent – Visual: Visual gameplay of your StudentAttackerController.

Example – Scored: Example of the scoring process for the example implementation.

TestAgent – Scored: This is what will be used to grade your submission.

Example – Debug: Runs 5 example trials and saves data about each game state to exec/experiment.txt.

TestAgent – Debug: Runs 5 of your trials and saves data about each game state to exec/experiment.txt.

In order to see a specific trial (0-indexed), you must edit the configuration for the TestAgent – Scored, and add

the trial number at the end of the program arguments. For example, if I want to see the 55th trial, it would appear

as such:

Hit Ok, and then run the TestAgent – Scored. The trial will be visually shown once it arrives at that trial.

Deliverables

Students will provide the following deliverables upon completion of the project:

1) StudentAttackerController.java file (as defined in the specification above)

2) Design and Post-Mortem document including identification of the following:

a. Diagram(s) and description of attacker behavior and methods with description (100-300 words)

b. Identifications of successes (“what went right”) and failures (“what went wrong”) (~300 words)

c. Reflection on project (one per student; 100-300 words)

Grading

Grading of the project will be as follows:

Design & Post-Mortem Document – 30%

This section of the grade will be based on completion and quality of the design and post-mortem document.

Agent Performance – 70%

The remaining portion of the grade will be based on assessment of student agent performance, with a score of

6400 points average over 100 tests attaining 100% credit:

Pct of Example Grade Example

110% 100% 7,040

75% 75% 4,800

1% 1% 64

Submission

Students will submit a single zip file with a “src” folder and a PDF (Acrobat) or HTML document on Canvas.

The path within the zipfile to the source (.java) file should be as follows:

src/edu/ufl/cise/cs1/controllers/StudentAttackerController.java

Your submission should look similar to this:

Failure to follow this submission format will result in a 10% penalty and your grade being released late.

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Atharva PatilComputer science

565 Answers

Hire Me
expert
Chrisantus MakokhaComputer science

792 Answers

Hire Me
expert
AyooluwaEducation

986 Answers

Hire Me
expert
RIZWANAMathematics

730 Answers

Hire Me

Get Free Quote!

315 Experts Online