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

you will write a program that will allow a person to play a number guessing game against the computer.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Specification

For this assignment, you will write a program that will allow a person to play a number guessing game against the computer. This section specifies the required functionality of the program. Only a text interface is required for this program; however, more marks will be gained for a game that is easy to follow with clear information/error messages to the player.

The aim of Numble Game is for a person and the computer to compete against the other to correctly guess a hidden number.

A game consists of four rounds. For each round, a number between 1 and 100 (inclusive) is randomly generated and the players (person and computer) take turns to guess the number. The round ends when the correct guess is given or each player has had three guesses.

If a player guesses the number correctly then they are awarded points according to how many attempts were taken to guess the number. If the round ends without either player guessing correctly then the points are awarded to the player whose last score was closest to the hidden number.

At the end of the four rounds, the player with the highest cumulative score wins the game.

 

Gameplay

Noun (class) Verb (methods)

 

The Numble Game begins with a message inviting the human player to enter their name. The name can contain any characters but must be no more than 8 characters in length. The other player will be the computer. A number with a value from 1 to 100 (inclusive) is randomly generated but hidden from the players. The player who will have the first turn at guessing the number is then randomly chosen by the computer. The round then progresses with the players taking turns until the correct number is guessed. Note that your program will generate a number guess for the computer player.

The following are the game rules:

 

If the number is not guessed correctly then a message is displayed indicating whether the entered number was higher or lower than the hidden number and then the other player takes a turn. Note this means that after each turn the range of possible numbers is reduced.

If the player enters a number between 1 and 100 but not within the possible range, then the player is given a warning message but is not given a chance to re-enter the number.

If the player enters a number less than 1 or greater than 100, then a warning message is displayed and the player is invited to enter another number (with no penalty).

If the player enters non-numeric characters, then a warning message is displayed and the player is invited to enter another number (with no penalty).

If a player correctly guesses the number then the round ends, points are awarded to this player according to how many attempts have been made. Note the total number of attempts includes attempts by both players. The other player scores zero for the game.

 

 

If the human player enters 999, this indicates that they have decided to abandon the round. The computer will randomly decide to abandon a round approximately once in every 20 guesses. If a player decides to abandon the round then the other player is awarded the points for the number of attempts that have been made, i.e. if the computer abandons the game after four attempts then the human player is awarded 5 points for that round. (Hint: to determine if the computer decides to abandon a round then choose a number between 1 and 20 as the ‘abandon game indicator’. For each round generate a random number between 1 and 20 inclusive. The game is then abandoned if the random number is equal to the abandon number indicator).

If the round ends and no player has guessed the number then the player whose last guess was closest to the hidden number is awarded a score of 1 point. If the guesses were equidistant from the hidden number then no score is awarded to either 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

860 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

826 Answers

Hire Me
expert
Husnain SaeedComputer science

779 Answers

Hire Me
expert
Atharva PatilComputer science

880 Answers

Hire Me
June
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
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
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