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

your project, you will be developing a simple battleship type game to test your knowledge of the concepts we have learned in Object Oriented Programming.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

For many of us old school gamers, we started out playing good old fashioned board games.  Many of us learned strategy from games like Risk and Battleship.  For your project, you will be developing a simple battleship type game to test your knowledge of the concepts we have learned in Object Oriented Programming.

 

The purpose of this project is to have you design of a fairly complicated project using concepts we have learned and then implement the solution using some of the code that we wrote in the previous projects along with new code, and then test your game.

 

You need to first start with the design of the project. If your design is carefully thought through, the coding of the game should be relatively straightforward since many of the classes and concepts closely match previous assignments.  You will need to first read these requirements and make a design document (ensuring that all the requirements are met in the design).  A sample design document is posted in Canvas and should be used as your design TEMPLATE (example).  Create a design document complete with the class diagram, as well as any decisions you made on the best use of classes, inheritance and exception handling. 

 

After you have completed your design, then you will be ready to implement the game and test.  Please don't leave things until the last two weeks.  Get started now, and please ask your instructor for help BEFORE you get too lost.  Get the big picture done first.  Worry about the structure and implementation of the major functionality.  Then if you have time, work on the little details, and minor error checking.

 

So now onto the requirements.     You sunk my battleship!….

 

For your CSCI 2312 Project, you will develop a simple battleship game. Battleship is a guessing game for two players. It is played on four grids.  Two grids (one for each player) are used to mark each players' fleets of ships (including battleships). The locations of the fleet (these first two grids) are concealed from the other player so that they do not know the locations of the opponent’s ships. Players alternate turns by ‘firing torpedoes’ at the other player's ships. The objective of the game is to destroy the opposing player's entire fleet. In our game, ‘firing a torpedo’ will be allowing the player to take a guess at where on the grid their opponent may have placed a ship.

 

In the requirements, we will set forth other simplifying rules to limit the scope of this project.

 

Requirements

 

Given the requirements as a rough specification, you are to design the classes and implement the game. In our imaginary game company, the requirements below were developed by the Product Development Team and your instructor is the Product Owner. You are in full control of the choice of classes (please use classes appropriately or points will be deducted), data structures, algorithms, internal file format, detailed user interface scheme, or any other pertinent design decisions you need to make.  As the Product owner, I care that it compiles and runs like it is supposed to, meets all the functionality and requirements I have set forth, and is easy to play and understand.

 

The Battleship game you are designing and implementing is a simplified version of the electronic Battleship game played in one player mode.

 

The game is played on four grids, two for each player. The grids are typically square and in our case will be 10 by 10.  The individual squares in the grid are identified by the x coordinate (indicated by a letter) followed by the y coordinate (indicated by a number). The following is an example of a 5 by 4 grid with an X in the position B3.

 

Each player uses two grids.  Each player uses one of their grids to arrange their ships and record the torpedoes fired by the opponent. On the other grid, the player records their own shots and whether they hit or missed.

 

Before play begins, each player secretly arranges their ships on their primary grid. Each ship occupies a certain number of consecutive squares on the grid (sizes of ships are in the following table), arranged either horizontally or vertically. The number of squares for each ship is determined by the type of the ship. The ships cannot overlap so only one ship can occupy any given square in the grid.  The types and numbers of ships allowed are the same for each player.

 

Ship Type Number of Grid Squares
Carrier 5
Battleship 4
Cruiser 3
Submarine 3
Destroyer 2

 

The game is played in rounds. In each round, each player takes a turn to fire a torpedo at a target square in the opponent's grid. The opponent then indicates whether the shot was a hit (a ship occupied the square) or a miss (there was not ship in the square).  If the shot is a “miss", the player marks their primary grid with a white peg (X in our game); if a "hit" they mark this on their own primary grid with a red peg (O in our game). The attacking player then indicates the hit or miss on their own "tracking" grid with the appropriate color peg (red (0) for "hit", white (X) for "miss") so that they can understand where the opponent’s ship might be.

 

In the board game, once all of the coordinates of a ship have been hit, the ship is sunk, and the ship's owner announces “You sunk my battleship! (Or whatever the particular ship that was destroyed). For our purposes, we will consider a battleship sunk if the opponent has a single hit. When all of one player’s ships are sunk, the other player wins the gameFor your game, you will create a one-person version of the game where ‘the computer’ will play for the second player. 

(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
Um e HaniScience

864 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

549 Answers

Hire Me
expert
Husnain SaeedComputer science

834 Answers

Hire Me
expert
Atharva PatilComputer science

698 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30