Top #cellularautomaton dweets

function u(t) {

c.width=1920 // clear the canvas
for(i=0;i<9;i++)
x.fillRect(400+i*100+S(t)*300,400,50,200) // draw 50x200 rects

} // 122/140

Please log in (or register) to post a dweet (copy-paste the code somewhere safe to save it meanwhile)


    u(t) is called 60 times per second.
    t: Elapsed time in seconds.
    S: Shorthand for Math.sin.
    C: Shorthand for Math.cos.
    T: Shorthand for Math.tan.
    R: Function that generates rgba-strings, usage ex.: R(255, 255, 255, 0.5)
    c: A 1920x1080 canvas.
    x: A 2D context for that canvas.

Try the new frontend: beta.dwitter.net
Current theme challenge: #Opposites

show FPS hide FPS share 1 remix fullscreen

metamero

remix of d/11466 by u/metamero

function u(t) {

eval(unescape(escape`渽挮睩摴栽ㄲ㠻䴽琿䴮浡瀨⡶Ⱬ⤽㹛測⵮ⴱⰭ測⵮⬱Ⱝㄬㄬ渭ㄬ渫ㅝ⹲敤畣攨⡡Ɫ⤽㹡⭍孫⭢崬〬瘦♸⹦楬汔數琨⟗✬欥測欯温⤩⹭慰⠨瘬欩㴾瘽㴳籼⡍孫崦♶㴽㈩⤺嬮⸮䅲牡礨㤲ㄶ⥝⹭慰⡶㴾䑡瑥⹮潷⠩┴⤻`.replace(/u(..)/g,"$1%")))

Dec 18 2018 2:23 AM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

jogo da vida #gameoflife #cellularautomaton

u/metamero

see d/11477

show FPS hide FPS share 1 remix fullscreen

metamero

remix of d/11461 by u/metamero

function u(t) {

eval(unescape(escape`渽挮睩摴栽㤶㭍㵴㽍⹭慰⠨瘬欩㴾孮Ⱝ渭ㄬ⵮Ⱝ渫ㄬⴱⰱⱮⴱⱮ⬱崮牥摵捥⠨愬戩㴾愫䵛欫扝ⰰⱶ☦砮晩汬剥捴⡫╮Ⱬ⽮簰ⰱⰱ⤩⤮浡瀨⡶Ⱬ⤽㹶㴽㍼簨䵛歝☦瘽㴲⤩㩛⸮⹁牲慹⠵ㄸ㐩崮浡瀨瘽㹄慴攮湯眨⤥㌩`.replace(/u(..)/g,"$1%")))

Dec 18 2018 1:32 AM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

jogo da vida #gameoflife #cellularautomaton

show FPS hide FPS share 1 remix fullscreen

metamero

function u(t) {

eval(unescape(escape`洽㌶Ᵽ⹷楤瑨㵮㴶㐻楦⠡琩景爨欽洪測䴽孝㭫ⴭ㬩䵛歝㵫㹮⨷㭍㵍⹭慰⠨瘬欩㴾嬭渭ㄬ⵮Ⱝ渫ㄬⴱⰱⱮⴱⱮⱮ⬱崮牥摵捥⠨愬戩㴾愫䵛欫扝ⰰⱶ☦砮晩汬剥捴⡫╮Ⱬ⽮簰ⰱⰱ⤩⤮浡瀨⡶Ⱬ⤽㹶㴽㍼籍孫崦♶㴽㈩`.replace(/u(..)/g,"$1%")))

Dec 17 2018 10:13 PM UTC

}// 140/140

Please log in (or register) to post as a new dweet (copy-paste code somewhere safe to save it meanwhile).

o jogo da vida - the game of life - #cellularautomaton

u/metamero

m=36,c.width=n=64;if(!t)for(k=m*n,M=[];k--;)M[k]=k>n*7;M=M.map((v,k)=>[-n-1,-n,-n+1,-1,1,n-1,n,n+1].reduce((a,b)=>a+M[k+b],0,v&&x.fillRect(k%n,k/n|0,1,1))).map((v,k)=>v==3||M[k]&&v==2)

You've reached the end.

dwitter.net | #cellularautomaton