Java programming, Basic Computer Science

Assignment Help:
Write a program that lets the user play the game Rock, Paper, Scissors against the computer. The program
should work as follows:
? When the program begins, the results of the previous run of the program (ie - how many wins the user
had versus how many wins the computer had) are read from a file and displayed. Note - if this is the
very first run of the program then a welcome message is displayed.
? A method is called to determine the computer''s choice. In the method, a random number in the range of
1 through 3 is generated. If the number is 1, then the computer has chosen rock. If the number is 2,
then the computer has chosen paper. If the number is 3, then the computer has chosen scissors. (Don''t
display the computer''s choice yet).
? The user enters his or her choice of "rock", "paper", or "scissors" at the keyboard. (You can use a menu
for user input if you prefer). Remember to validate user input.
? The computer''s choice is displayed.
? A method is called to determine the winner according to the following rules:
o If one player chooses rock and the other player chooses scissors, then rock wins. Rock
smashes scissors.
o If one player chooses scissors and the other player chooses paper, then scissors wins. Scissors
cut paper.
o If one player chooses paper and the other chooses rock, then paper wins. Paper covers rock.
o If both players make the same choice, the game must be played again to determine the winner.
? A count of the number of wins for the user and for the computer is kept.
? The user is given the opportunity to play again.
? When the user is finished playing, the count values are written to the screen and to an output file for
later use.

Related Discussions:- Java programming

N-ary relationships in database design, n-ary relationships in database des...

n-ary relationships in database design Each n-ary where n>2 relationship type is maped into a table name of the relationship works as the name of the table. The primary key of suc

Explanation pre increment with example, Problem 1 What is precedence of...

Problem 1 What is precedence of operators? How are expressions evaluated using precedences? Defining precedence of operators Explanation of how expressions are evaluat

Data structures hw help, Create an implementation of the Ordered Associativ...

Create an implementation of the Ordered Associative Array API using left-leaning red-black trees. Illustrate the use of the API by refactoring your WordBench as a client of Ordered

Programming Project 1, Programming Project You will implement 2 algorithms...

Programming Project You will implement 2 algorithms to solve the single source shortest paths problem, Bellman-Ford Algorithm and Dijkstra''s algorithm Allowed programming languag

Describe the binary search algorithm, QUESTION 1 Describe the binary se...

QUESTION 1 Describe the binary search algorithm using an example of your own. QUESTION 2 (a) By showing all your workings, give a big-O estimate for f(x) = (x + 1)lo

Socket programming, Important: • No cheating will be tolerated. • No late s...

Important: • No cheating will be tolerated. • No late submissions. Total Points for this programming assignment: 100 The goal of your programming assignment is to build and experim

Graphs, Find the corresponding matrix of the digraph above

Find the corresponding matrix of the digraph above

Output design, Discuss the factors considered during output design

Discuss the factors considered during output design

Analyze the complexity of dijkstra''s algorithm, QUESTION (a) Given the...

QUESTION (a) Given the graph as shown in figure, apply Lagrangian technique to complete the table assuming μ=1 and T=14                        Path P

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd