So am I.

Here's what I got.

rand 0 50 100

Josiah 201 201 191

Xeda 477 334 353

I dunno, it's really at the mercy of the generator. And how many times you use it.

OK, it's settled.

Xeda and I are going to have a competition.

The rules:
We must modify our codes to be almost similar, except for mine using lists and hers using matrices. (i.e. either I generate my snowflakes one after another, or she generates hers at random times)
We must each test 3 values of rand: 0, 10, and 100.
We shall make another program in this format and run it:
startTmr -> Z
prgmOURSNOW
Disp checkTmr(ZWhoever has a lower value for most of them is the winner.

Really? Cause it has.

Try setting 100 as rand before starting the program. You'll see what I mean.

Works, except for one thing...

When there is only one opening in the top spot, it freezes. I recommend you just generate a snowflake position, and if a snowflake isn't there already, then and only then can you add it as a snowflake.

Mine draws the flakes when they are newly added at the top of the screen, then it searches the matrix for snowflakes that can move down. It erases those ones and draws their new position.

Also, DJ_O, you didn't need the "1=" part of those If statements.

* Xeda112358 runs

The way I test for flakes that can move is I store the matrix rotated so that column 1 is the first row of snow flakes. Then each snow flake is represented by the column number it is in (so if it is homescreen column 6, it has a 6 in the matrix). My code is then:

Code: [Select]

Matr>list([A],8,L2 ;get the last row
For(A,7,1,-1
Matr>list([A],A,L1
L1*(L1 and not(L2→L3 ;This checks if anything in L1 can move down into L2
;"not(L2" leaves a 0 where there is already a flake, else 1 if empty
;Then "L1 and not(L2" leaves a 1 if there is a snowflake above an empty space
L1-Ans→L1 ;remove the snowflakes that can move down from L1
While max(L3
max(L3→B ;location of the snowflake furthest to the right
0→L3(Ans ;remove the snowflake from L3, the list of moveable flakes
0→[A](B,A ;remove it from the matrix
Output(A,B," ;Erase it
min(16,max(1,B+1-2int(2rand ;randomly move left/right
If L2(Ans ;check if the space is occupied
B
Ans→[A](Ans,A+1 ;write the snowflake to the new coordinate
Output(A+1,Ans,"*
End
L1→L2 ;now This row becomes the new lower row
End


Can you give me the full code?

Hmm, you could use a matrix (it uses indices the same as pixel coords or homescreen coordinates, so "Y" then "X").

This way, the program doesn't start to slow down as more snow flakes are added. Basically, just create an 8*16 matrix (it will be huge, being the size of a 128 element list). Then you can just check if a snow flake is already in a spot as if you were reading homescreen coordinates:

Code: [Select]

[A](Y,X

This might speed things up a bit (not sure).

You're right! Now, it will only take 128 iterations of a For( loop (plus a little bit extra time) to move and display the snowflakes, not to mention to extra size of a matrix!

Besides, I think it's pretty fast already.

I have all of the coordinates in Y.X format (i.e. Y=7 and X=12 would be 7.12), and each time I need to know if a snowflake is in a spot, I check sum(L1=Y+.01X). If it's 1, a snowflake is in that spot.

Quote from: dreamdragon on January 23, 2014, 05:23:31 pm

Quote from: LDStudios on January 23, 2014, 05:20:22 pm

Quote from: flyingfisch on January 23, 2014, 04:30:59 pm

welcome fellow tanki player!

I play too, ill send u a friend request

Quote from: dreamdragon on January 23, 2014, 04:42:59 pm

ps how do i get mine like this...

you need to be staff or have 1000 posts

sadface

how can i be a staff?
any requirements?

I think you are more likely to get >1337 posts...

Also, remember quality, not quantity.

And this looks like the beginning of a quote tree...

* flyingfisch runs

Let's keep the tree running!


And welcome to Omni! I just have no peanuts.