Scribd
Upload
2 views4 pages

Tetris Programming Exercise

The document outlines the requirements for creating a simplified Tetris engine that models a grid where pieces fall and settle due to gravity. It specifies the input format for pieces and their positions, as well as the expected output, which is the height of the remaining blocks in the grid after processing a sequence of pieces. The program should handle specific Tetris shapes without rotation and must output results in a defined format without additional formatting or representations.

Uploaded by

533raghav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views4 pages

Tetris Programming Exercise

The document outlines the requirements for creating a simplified Tetris engine that models a grid where pieces fall and settle due to gravity. It specifies the input format for pieces and their positions, as well as the expected output, which is the height of the remaining blocks in the grid after processing a sequence of pieces. The program should handle specific Tetris shapes without rotation and must output results in a defined format without additional formatting or representations.

Uploaded by

533raghav
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

DRW Trading Page 1 of 4

Proprietary and Confidential

You are to write a simplified Tetris engine.

The engine should model a grid that pieces enter from top and come to rest at the
bottom, as if pulled down by gravity. Each piece is made up of four unit squares. No
two unit squares can occupy the same space in the grid at the same time. The
pieces are rigid, and come to rest as soon as any part of a piece contacts the
bottom of the grid or any resting block. As in Tetris, whenever an entire row of the
grid is filled, it disappears, and any higher rows drop into the vacated space without
any change to the internal pattern of blocks in any row.

Your program must process a text file of lines each representing a sequence of
pieces entering the grid. For each line of the input file, your program should output
the resulting height of the remaining blocks within the grid.

The file denotes the different possible shapes by letter. The letters used are Q, Z, S,
T, I, L, and J. The shapes of the pieces they represent are shown in the diagram
below.

You do not have to account for shape rotation in your model. The pieces will always
have the orientations shown above.

Each line of the input file is a comma-separated list. Each entry in the list is a single
letter (from the set above) and a single-digit integer. The integer represents the
left-most column of the grid that the shape occupies, starting from zero. The grid of
the game space is 10 units wide. Your program need not detect whether any
sequence of pieces will exceed any particular height, but you may assume that no
test case will result in a height of greater than 100. For each line of the file, the
grid’s initial state is empty.

For example, if the input file consisted of the line “Q0” the corresponding line in the
output file would be “2”, since the block will drop to the bottom of the initially
empty grid and has height two.
DRW Trading Page 2 of 4
Proprietary and Confidential

An input file called “input.txt” has been provided.

Your program will be invoked from a command line, taking its input from STDIN and
writing its output to STDOUT. For instance:

$ ./tetris < input.txt > output.txt

Your program does not need to validate the file format and can assume that there
will be no illegal inputs in the file, however the output to STDOUT does need to
match the following format:

example of output to STDOUT:

Where each new line contains a number representing the height of a row.

Note: Please do not add any extra formatting or ASCII representations of the game
to the output. Doing so will make your submission fail our solution checker.

Further examples are in the following pages


DRW Trading Page 3 of 4
Proprietary and Confidential

Example 1

A line in the input file contains “I0,I4,Q8” resulting in the following configuration.

The filled bottom row then disappears.

Therefore, the output row for this sequence is “1”.

Example 2

A line in the input file contains “T1,Z3,I4”.

No rows are filled, so the output for this sequence is “4”.

Example 3
DRW Trading Page 4 of 4
Proprietary and Confidential

A line in the input file contains “Q0,I2,I6,I0,I6,I6,Q2,Q4”. After the first three pieces
drop, the result is as follows:

The bottom line is cleared, and after the next five pieces drop, here is the result:

The second line clears, and the final result is as follows:

Note that the rows drop as rows, and do not fill gaps in the rows below. So the final
output for this test case is “3”.

You might also like