Here is my code.
It seems like no one else is doing this challenge, also i don't think i can make it shorter.
although I could use some really meaningless methods (such as putting all variables in one variable using div/mod).
But even if that makes the program having lesser lines, it wont really make the program smaller in size.
I think the contest would be better if it is marked based on the size(in bytes) instead of line number.
anyway. the program is 80 line (by that i mean after f2 and does not generate a not enough memory for indent message.)
I don't think i will have time to work on this since it ends on sunday and i have quite lot of things to do this week.
I would really like to see how zylum did it. zylum's is almost 1kb smaller
(still looks impossible   )
| Turing: | View.Set ("offscreenonly;graphics:200;300,position:bottom;left,nobuttonbar")
var m, bk, eb : array 1 .. 22, 1 .. 12 of boolean
var g, ol := false
var x, y, cb, dt, score := 0
var nx := Rand.Int (1, 7)
var data : array 1 .. 28 of string := init ("0000000011110000", "0000011001100000", "0000001101100000", "0000011000110000", "0000010001110000", "0000000101110000", "0000001001110000",
"0010001000100010", "0000011001100000", "0000001000110001", "0000000100110010", "0000001100100010", "0000001000100011", "0000001000110010",
"0000000011110000", "0000011001100000", "0000001101100000", "0000011000110000", "0000000001110001", "0000000001110100", "0000000001110010",
"0010001000100010", "0000011001100000", "0000001000110001", "0000000100110010", "0000001000100110", "0000011000100010", "0000001001100010")
var keys : array 1 .. 20 of string := init (KEY_LEFT_ARROW, "1", "0", "0", "1", KEY_RIGHT_ARROW, "-1", "0", "0", "1", KEY_DOWN_ARROW, "0", "1", "0", "20", KEY_UP_ARROW, "0", "0", "1", "1",)
for i : 0 .. 22 * 12 - 1
eb (i div 12 + 1, i mod 12 + 1) := false
m (i div 12 + 1, i mod 12 + 1) := i div 12 + 1 = 1 or i div 12 + 1 = 22 or i mod 12 + 1 = 1 or i mod 12 + 1 = 12
end for
proc newb (b, x, y, sx, sy : int, DM, DB : boolean)
ol := false
g := false
bk := eb
for i : 0 .. 22 * 12 - 1
if i > 0 and i <= 16 and y + (i - 1) div 4 > 0 and x + (i - 1) mod 4 > 0 and x + (i - 1) mod 4 <= 12 and data (b ) (i ) = '1' then
bk (y + (i - 1) div 4, x + (i - 1) mod 4) := true
ol := ol or ((m (y + (i - 1) div 4, x + (i - 1) mod 4)) and y + (i - 1) div 4 < 22)
g := g or ((y + (i - 1) div 4 - 1 > 0 and m (y + (i - 1) div 4 - 1, x + (i - 1) mod 4)) and bk (y + (i - 1) div 4, x + (i - 1) mod 4))
end if
if (m ((i div 12 + 1), (i mod 12 + 1)) and DM ) or (bk ((i div 12 + 1), (i mod 12 + 1)) and DB ) then
drawfillbox (sx + (i mod 12 + 1) * 10 - 8, sy + (i div 12 + 1) * 10 - 8, sx + (i mod 12 + 1) * 10, sy + (i div 12 + 1) * 10, 145)
end if
end for
end newb
loop
cb := nx
nx := Rand.Int (1, 7)
x := 5
y := 19
newb (cb, x, y, 5, 5, true, true)
exit when ol
loop
if hasch then
var key := getchar
for i : 0 .. 3
if key = keys (i * 5 + 1) then
for j : 1 .. strint (keys (i * 5 + 5))
x - = strint (keys (i * 5 + 2))
y - = strint (keys (i * 5 + 3))
cb := (cb + strint (keys (i * 5 + 4)) * 7 - 1) mod 28 + 1
newb (cb, x, y, 5, 5, false, false)
exit when ol
end for
if ol then
x + = strint (keys (i * 5 + 2))
y + = strint (keys (i * 5 + 3))
cb := (cb - strint (keys (i * 5 + 4)) * 7 - 1) mod 28 + 1
end if
end if
end for
end if
dt + = 1
newb (cb, x, y, 5, 5, true, true)
y + = ord (ol ) - ord (dt mod 5 = 0)
exit when g and not ol and dt mod 5 = 0
put "SCORE: ", score
newb (nx, 2, 2, 120, 220, false, true)
View.Update
Time.DelaySinceLast (100)
cls
end loop
for i : 0 .. 22 * 12 - 1
m (i div 12 + 1, i mod 12 + 1) := bk (i div 12 + 1, i mod 12 + 1) or m (i div 12 + 1, i mod 12 + 1)
end for
for decreasing i : 22 - 1 .. 2
if m (i, 11) = true and m (i, 2) = true and m (i, 3) = true and m (i, 4) = true and m (i, 5) = true
and m (i, 6) = true and m (i, 7) = true and m (i, 8) = true and m (i, 9) = true and m (i, 10) = true then
score + = 1
for k : i * 12 .. (22 - 2) * 12
m ((k div 12), k mod 12 + 1) := m ((k div 12) + 1, k mod 12 + 1)
end for
end if
end for
end loop
put "Game Over"
|
|
It's harder than it looks to apply the standard rules. Theres a lot more going on in tetris than in pong, and so far the record for that is 19 lines by Catalyst.. The user controls are more complex, there are more variables to keep track of, the collisions are much more complex, the drawing is more complex. You have to collapse the stack once a row is complete... You get the picture 
I would be lucky to make "a tetris" in 40 lines...
And yes, I also used "cheap" tricks, but thats what makes it so fun.. Trying to squeeze out every last line is fun and challenging and makes you look at the problem differently.
: Bits = round (10000 / max (lines - 50, 1)) - 50
I used a lot of bit manipulation to make it short. I think my main game loop can be shortened a bit but I'm too lazy now 
