Tetris part 2

-

The GameEngine Class


So, this is mainly going to be about the GameEngine class.

The main job of the GameEngine is to update and render the game environment.
Now, at any moment , there is only one falling Group. So that is signified by currentGroup .
Apart from that, the Blocks that have already fallen, are just kept in a 2D array. For purposes of collision detection, this array has a padding. The padding is also required as we do not want a block to instantly appear .. We want to to appear slowly, that is first, the lowermost layer, then the middle and finally the upper layer. ( Groups have 3 rows each).

The update function, at each call, moves the current Group  down, creates one if not present, and then checks whether any lines have formed.

Since this is a small scale game, concurrency of threads has not been considered. When the player presses a key, the methods of the GameEngine are called from the Event thread itself. The Player can rotate or shift the Group s only, no other functionality is there.

During rendering, the padding is not shown. As a result, since the currentGroup always starts from the top row in the grid, it is shown part by part.

Now, since we are using a small grid based system, collision detection is really easy, I am not going to go through that.

During rendering, the render method of all the Blocks that have already fallen and that of the currentGroup are called. though the main information retrieved is the color of that block.
Again, this takes advantage of the grid system, as for all blocks, we know exactly where to paint it.

This is really all the GameEngine does.

Comments

Post a Comment

Popular posts from this blog

Small-to-Large

-
The Vanilla Method Let's take the given problem: We have some sets as U = {S1,S2,S3....Sn} where U is the "container" set. Initially each set contains a single element. After each operation each set will contain some numbers. We define the cost of a set as the number of unique elements in the set. For each query, we merge two unmerged set and then report the sum of cost of all the sets.  The most brute force approach is for each query, add all numbers in one of the sets and put them in the other set. This will take approximately O(nlogn) time per merge operation and since there can be about O(N) mergings (because after atmost N mergings there will be only 1 set left) this will take time proportional to O(n^2logn) time. For the report, part, we just return the sum of the sizes of the set. This part is O(1) as we only have to check the size of the new merged set as the sizes of the other sets haven't changed. This is obviously a poor algorithm for a seem
Read more

Segment Tree Beats - An introduction

-
Segment Tree Beats  Disclaimer : This post is based on a recent post made by jiry_2 on codeforces. Before I begin, a clear understanding of segment tree and lazy propagation is required.  If you don't know those, I would recommend you to go search it up online and read it thoroughly, before coming back. With that out of the way, here goes... Hey wait wait wait. Hold on. Just to clarify, now that you have read it, in case you are confused with what I call terminal nodes in a segment tree update/query, it's basically the node that is completely inside the update range, the one where we generally end our search in a segment tree. I say generally.. well.. you will see :). Anyway without further ado...  A simple problem So the first problem I want to address, and it is fairly easy, is supporting two operations on a range: Range minimize (for each i in range, make it min(i, update_value) )  point query Solution : This is just a variant of the normal lazy
Read more

Getting prepared for RMO

-
Regional Mathematics Olympiad The Regional Mathematics Olympiad (RMO) is the second stage in the selection for the selection of the Indian team to the IMO, the first being the pre-RMO. It is one of the tougher olympiads conducted across India, wherein only about 300 students are selected to sit for the Indian National Mathematics Olympiad(INMO). The main thing that makes RMO tough, at least for the common students, is twofolds -- firstly, the syllebus is quite a bit different than the normal class X or XI curriculum that is followed in schools, especially in areas like combinatorics and number theory, the latter being a topic that is scarcely touched upon. Secondly, in topics that are known to us, like geometry, the level of questions, even if they don't require advanced theorems and results, they need a level of creativity that cannot be mastered overnight. From hereon I will say what I did to clear it last year.. when I was studying in class IX. Firstly, I focused heavil
Read more