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

For this assignment, you will design a game called ThePlaceMatch. In this game, here is one player who is playing against the computer

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

 For this assignment, you will design a game called ThePlaceMatch. In this game, here is one player who is playing against the computer. The game presents the player with a grid with numbers shown in a 3 x 3 chart as in Figure 1 below.

 

1

2

3

4

5

6

7

8

9

Figure 1

 

Please note that the chart shown is labeled with numbers for visual clarity, for the purpose of explanation, and to guide play. The game must show the numbers to the users in the given positions.

 

Step1: At the start of the game, the game will print a message to explain ThePlaceMatch to the player, welcome them, and ask them for the three first letters of a country. The game will then use a random number generator to generate six numbers between 1 and 9. The player will NOT be shown the six numbers. The game will use the six numbers to place the letters from the country name twice in the chart at the given positions.

 

So, for example, if the country that the country thinks of is Mauritius the first three letters entered will be MAU. Then, the game’s random number generator might generate the numbers: 9 5 6 7 8 1. The letters entered would then be assigned by the game (but hidden from the user) as shown in Figure 2.

 

1

U

2

3

4

5

A

6

U

7

M

8

A

9

M

 

Figure 2

 

 The game will still show the user the chart as in Figure 1. Please note that in Figure 2, positions 9, 5 and 6 are the first, second and third initials respectively and positions 7, 8 and 1 are the repeats of each respectively.)

 

Step 2: The game will then ask the player to guess positions for matching country letters by choosing two numbers between 1 and 9.

 

Step 3: The game will show the user the letters in the given position. If the position is empty it will show a question mark (?) in the position. So for example if the player chooses 1 and 2 as the positions. The game will show the chart as follows:

 

1

U

2

?

3

4

5

6

7

8

9

Figure 3

 

Step 4: The game will pause and so that the user can view the results for a few seconds. Then the game will show the chart as shown in Figure 1 again and ask the player to guess again, by giving two positions.

 

Step 5: When the user finds that there are letters on the chart that are the same, for example chooses the coordinates for the two occurrences of the first letter as in Figure 4. The game will continue to show the two same initials as the user views the chart and continues to guess the other initials.

 

The play, requesting positions and displaying results, Steps 2 through 5, will repeat until the player wins.

 

1

2

3

4

5

6

7

M

8

9

M

Figure 4

 

The player wins when all of the three letters from the country have been matched. At each point when the player finds two of the same letter, that letter will be maintained on the screen until the game is completed. The game must let the player know that they have won with a suitable message.

 

You are required to develop a COMPLETE pseudocode algorithm solution for  ThePlaceMatch. You can use simple variables for this and are not required to use any variable types beyond simple variable types like int, char, float etc. Arrays are NOT necessary.

 

Your solution must include:

 

  1. A commented pseudocode algorithm
  2. A flowchart for the algorithm
  3. One test plan comprised of a desk trace with a set of data showing the walkthrough of how variables change as the algorithm Specifically, the desk trace must show the inputted data, the values in the variables, and then outputs to the screen. Use MSExcel to show this.
  4. An innovation beyond these specifications. State its necessity and novelty in the comments.
(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

538 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

733 Answers

Hire Me
expert
Husnain SaeedComputer science

838 Answers

Hire Me
expert
Atharva PatilComputer science

734 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