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

you will build some of the foundational infrastructures of a program that implements the rules of the game Breakdown

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Part 1:

For this assignment, you will build some of the foundational infrastructures of a program that implements the rules of the game Breakdown. Later in the quarter, you will write a program to interactively play the game. But before we get to that task, we need to establish what the game is: what data structures represent it, what its rules are, what constitutes a victory, etc.
You will not need to become good at playing Breakdown yourself in order to complete this project; you only need to have a complete understanding of the rules, which are specified in this document.
===> Breakdown
The breakdown was created by a computer science professor at an Illinois university who turned it into a class assignment when he couldn't get any company to license the rights to it. The game is played with pieces on a board, but, unlike many board games, the board stands up vertically. There is a grid consisting of rows and columns, the cells of which can be empty, be occupied by a black piece, or be occupied by a white piece. Pieces, known as sticks, are more than one grid cell in size. Because of gravity, sticks fall down in a column to the lowest spot they can reach. Note that they do not move laterally or rotate as they fall. Because sticks are rigid, they can have an "overhang," in which part of the stick is supported by pieces below it, but another part is hanging over empty space. (Examples below will clarify.)

Players take turns, starting with black, then white, then black, and so on. The game can be played with boards of different dimensions. We will show examples in the format that your program will display boards to screen.

  0123

0 ....

1 ....

2 ....

3 ....

4 ....

This is a board with 5 rows and 4 columns, empty at the start of the game. Empty spaces are depicted with period (.) characters.

In this particular example, we will play a game with sticks that are two grid cells long. The length of sticks is configurable from game to game, but fixed during a specific game.

Black moves first. This player drops a black stick (which will be drawn using asterisks [*]) into column 0, vertically:

  0123

0 ....

1 ....

2 ....

3 *...

4 *...

Because there were no pieces occupying column 0, the black stick immediately falls to the bottom of this column.

White moves next, and drops a stick horizontally in columns 2-3. White's sticks will be depicted using lower-case letter o (as in Oscar).

  0123

0 ....

1 ....

2 ....

3 *...

4 *.oo

White's stick similarly falls to the bottom row due to gravity.

Next, Black drops a stick horizontally in columns 0-1.
  0123

0 ....

1 ....

2 **..

3 *...

4 *.ooSince part of this stick is propped up by the stick below it, this new stick only makes it down to row 2. This is an example of the idea of an overhang: a stick dropped horizontally remains rigid, and only falls as far as the highest point where it can rest, across all of its columns. In this particular example, it may seem plausible that this could happen, as half the stick is supported. But, to be clear, even if the stick were much longer, and only one of the columns under the stick were supporting it, it would still be able to overhang. Put another way, sticks can successfully hang, even if there is "air" underneath most of their columns, so long as at least one column is supported.

Another aspect to note is that this depiction of the board does not show the outlines of the sticks; there are two Black sticks, occupying a total of four cells. But, the fact that one is a vertical stick, with a second, horizontal one resting on it, is not explicitly acknowledged, only the overall view of which cells are occupied by Black. In fact, our program will not retain this knowledge, either. It will be sufficient simply to keep track of which cells are occupied by which color. It is only while a stick is being dropped, and gravity is being simulated, that sticks must be thought of as a single rigid unit; after the stick is placed in the appropriate location, mere cell occupancy is sufficient going forward.

White moves next, and drops a piece horizontally in columns 1-2.

  0123

0 ....

1 .oo.

2 **..

3 *...

4 *.ooThis stick is also propped up by the presence of occupied Black cells below it, and has its own overhang. Note that the White stick is stable at this location; although it might be tempting to think that the Black stick below it, which is not fully supported , might break under the weight of the White stick above its unsupported part, this is not an aspect of the physics of the game. Sticks fall until any part of them lands on top of an occupied cell, then rest there.

You may be wondering what happens if you try to drop a stick in a column that is full to the top row, or to drop a stick vertically into a column that does not have enough room for the entire height of the stick. This is simply not allowed.

For each of the moves so far, players have taken turns dropping sticks. But, during a player's turn, they can, instead, perform a "breakdown" move. When they do, all sticks lose their rigidity and break down into individual squares the size of grid cells. These squares then fall within their columns if there was "air" beneath them.

(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

574 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

931 Answers

Hire Me
expert
Husnain SaeedComputer science

885 Answers

Hire Me
expert
Atharva PatilComputer science

877 Answers

Hire Me
March
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
23
24
25
26
27
28
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
31
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