首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
代写program、代做java设计程序
项目预算:
开发周期:
发布时间:
要求地区:
Game Description
Battleship is a classic two-player game in which you aim to sink all of your opponent's ships before they sink yours.
Each player has a fleet of ships that they place on a grid, and they take turns guessing the locations of their
opponent's ships. In this game version, one player is a human, and the other is a computer.
SETUP
Board: Each player has a 10x10 grid (board) where they place their ships.
Ships: Each player has a fleet consisting of different types of ships:
Battleship: Occupies 4 cells.
Carrier: Occupies 5 cells.
Submarine: Occupies 3 cells.
Patrol Boat: Occupies 2 cells.
Ships can be placed either horizontally or vertically on the grid.
GAME PLAY
Ship Placement:
Human Player: The human player manually places their ships on their grid. They are prompted to select the type of
ship, its starting coordinates, and its orientation (horizontal or vertical).
Computer Player: The computer player's ships are automatically placed on its grid based on predefined
configurations read from a configuration file (config.txt).
TAKING TURNS:
Players take turns guessing the locations of their opponent's ships by specifying coordinates (x, y) on the grid.
The game announces whether the guess is a "hit" or a "miss." A hit means that part of a ship is located at the
guessed coordinates. A miss means there is no ship at the guessed coordinates.
WINNING THE GAME:
The game continues until one player has sunk all their opponent's ships.
A ship is considered sunk when all of its cells have been hit.
The player who sinks all of their opponent's ships first is declared the winner.
Game Specifications:
The game board is a 10x10 grid, each cell represented by square brackets []. The grid is used to place ships and
make guesses. Each cell can either be empty, contain part of a ship, or be marked as a hit or miss.
This is what the empty game board looks like before ships have been placed:
IDENTIFIERS FOR SHIPS:
Ships: Ships are represented by their identifiers in the cells they occupy.
Battleship (B)
Carrier (C)
Submarine (S)
Patrol Boat (P)
Here is a sample board that the human player will see when placing their own ships:
TRACK HITS AND MISSES
Another board is used to keep track of the hits and misses.
A hit is marked with an X.
A miss is marked with an O.
Here is an example board:
CONFIG.TXT
A configuration file must be read to set up the computer player's arrangement of the board. The configuration file
should contain a separate line for each type of ship. Each line should include the ship's name, the x coordinate, the
y coordinate, and whether the placement is horizontal (H) or vertical (V).
Here is a sample config.txt:
Submarine 2 2 H
Battleship 3 3 H
PatrolBoat 4 5 V
Carrier 5 6 H
This is the result:
PROMPT
The program will first read and parse the config file, building the game grid for the computer player. Then, the
human player will be prompted to input the type of ship, the starting x and y coordinates, and whether the ship
should be placed horizontally or vertically on the game board. After entering the details of each ship, the player
should see the grid displayed. Once all of the ships have been placed (one of each kind), the player will be
prompted to guess the location of one of the computer’s ships by entering the x and y coordinates. If the player
guesses the correct location of one of the ships, the player receives a message indicating a hit. The player should
be able to take another turn if they correctly “hit” the computer’s ship. If the player receives a “miss,” the
computer should take a turn, printing out its guess to the player and indicating whether it was a hit or miss. The
prompt should also indicate when a ship has been “sunk” (all spots on the grid for that ship are guessed). The
game continues until one player sinks all of the opponent's ships. The player who sinks all of the opponent's ships
first is declared the winner.
Requirements
The base game components have been provided to you in D2L. Those *.java files contain the clues you need to
complete a functioning Battleship game. You shouldn’t need to re-write any existing code provided; you must use
the methods and data types indicated. However, you can add any additional classes or enums if you wish.
You are to avoid the use of global variables or non-private class variables (using enums is permitted).
Submission
Submit your completed *.java files to D2L. Do not submit *.class files or any other files. Include your name and
UCID at the top of both of those files.
Demonstration
You must demonstrate your assignment to the tutorial leader. The tutorial leader will ask questions to test your
understanding of your submitted code. If you cannot sufficiently answer the questions, your assignment will
receive an incomplete. You will then need to arrange a peer-programming session with the TA to demonstrate
your knowledge of the fundamental aspects of this assignment, where you will be capable of receiving a maximum
grade of C-. Failure to complete this session satisfactorily will result in an F for the assignment.
Unit Tests
To prove your implementation, you must create unit test cases for the code’s functionality.
Grading
We will simplify the grading process for this assignment.
A GRADE REQUIREMENTS:
Submission: The assignment is submitted on time to D2L with all required files and a link to GitLab with the TA as a
developer.
Full Functionality: All required functionality is implemented.
Code Documentation: The student explains the code with clear comments and documentation.
Code Explanation: The student satisfactorily answers the tutorial leader's questions about the code and clearly
understands the implementation.
Unit Tests: Adequately tests the program and demonstrates the various principles of unit testing.
B GRADE REQUIREMENTS:
Submission: The assignment is submitted on time to D2L with all required files and a link to GitLab with the TA as a
developer.
Full Functionality: All required functionality is implemented.
Code Explanation: The student satisfactorily answers the tutorial leader's questions about the code and clearly
understands the implementation.
One or more of these are insufficient:
Test Cases: Some test cases are missing or not comprehensive.
Documentation: Some parts of the code are not adequately documented.
Code Quality: The code is mostly clean and well-organized but may have minor issues in naming conventions
or structure.
C GRADE REQUIREMENTS:
Submission: The assignment is submitted on time to D2L with all required files and a link to GitLab with the TA as a
developer.
Code Explanation: The student satisfactorily answers the tutorial leader's questions about the code and clearly
understands the implementation.
One or more of the following apply:
Limited Functionality: File reading/user input is complete, but other methods/mechanics are not.
Limited/No Test Cases: Some test cases are missing or not comprehensive.
Limited/No Documentation: Some parts of the code are not adequately documented.
Code Quality: The code is mostly clean and well-organized but may have minor naming conventions or
structure issues.
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
代做 program、代写 c++设计程...
2024-12-23
comp2012j 代写、代做 java 设...
2024-12-23
代做 data 编程、代写 python/...
2024-12-23
代做en.553.413-613 applied s...
2024-12-23
代做steady-state analvsis代做...
2024-12-23
代写photo essay of a deciduo...
2024-12-23
代写gpa analyzer调试c/c++语言
2024-12-23
代做comp 330 (fall 2024): as...
2024-12-23
代写pstat 160a fall 2024 - a...
2024-12-23
代做pstat 160a: stochastic p...
2024-12-23
代做7ssgn110 environmental d...
2024-12-23
代做compsci 4039 programming...
2024-12-23
代做lab exercise 8: dictiona...
2024-12-23
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!