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

For this assignment we will be creating a simple BINGO game.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

For this assignment we will be creating a simple BINGO game. Your program will create a BINGO card, play through the game by entering “called” numbers, and determine when you have a

winning card. You’ll create a class for BINGO card that will deal with the creation of the card and any operations associated with it, and a second class that will contain your main method to call your other class and run the program. The wikipedia page contains information about the game if you need it, but the most relevant section is: “A typical Bingo game utilizes the numbers 1 through 75. The five columns of the card are labeled 'B', 'I', 'N', 'G', and 'O' from left to right. The center space is usually marked "Free" or "Free Space", and is considered automatically filled. The range of printed numbers that can appear on the card is normally restricted by column, with the 'B' column only containing numbers between 1 and 15 inclusive, the 'I' column containing only 16 through 30, 'N' containing 31 through

45, 'G' containing 46 through 60, and 'O' containing 61 through 75.” This tells us how the card should be constructed. The victory conditions are when you have a row, column, or diagonal filled.

 

Requirements:

Name your classes BINGOCardLastNameFirstName and BINGOGameLastNameFirstName.

Be sure to follow the above mentioned conventions in regards to card creation and victory conditions.

You should create a unique card each time the program is run, not a pre-entered one.

Make sure that you don’t have a card with repeated numbers on it.

All operations that deal with the card should happen through the BINGOCard class.

You’ll create an instance of your BINGOCard in your BINGOGame’s main which is how you’ll interact with it.

You can only import the Scanner class, everything else you need you will create or is already available to you.

 

Hints:

Making different methods to do various game activities (create the card [Constructor], print the card, check for win conditions, etc) will make things much easier.

For now, choosing a fairly naive way of marking the free space and called spaces may work best (we don’t need to preserve the original card, see the sample below).

Assume you’ll only have one card and will keep going until that card is a winner.

 

Submission:

Name your classes as detailed above and upload only the associated .java files to Moodle. You may leave your work as a draft as that will allow you to change the files you uploaded should you notice a problem or upload the wrong file. However, keep in mind, I will only see the time of the final file upload so please check your files as soon as you upload them. By submitting a file to be graded, whether draft or fully submitted, you are agreeing to the academic integrity policy as outlined in the syllabus and student handbook.

 

Sample Output:

Your output doesn’t need to match this exactly, this is just a quick run with my solution to give you an idea of one possibility. Note that I use 0’s to mark filled spaces since they aren’t a valid number for play via the rules, you can use this or any other way to mark the filled spaces.

Note that I have bold/underlined user input for clarity of where I typed something in. This isn’t something your program needs to do.

 

 

(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

874 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

575 Answers

Hire Me
expert
Husnain SaeedComputer science

845 Answers

Hire Me
expert
Atharva PatilComputer science

950 Answers

Hire Me
April
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
30
31
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
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