Top #improved 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: #ScaryMovies

show FPS hide FPS share fullscreen

pavel

remix of d/1112 by u/sigveseb

function u(t) {

for(let w=c.width=127,i=9086,a,b,n,B;a=i&w,b=i--/w;x.fillRect(a,b,1,1/(t+a/n&1^b/n)))n=b-20,B=(w*S(t*9+n/9)+(a-40)**2+n*n)/1e3,n*=B>1||C(B)

Mar 7 2019 8:31 PM UTC

}// 139/140

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

#improved performance

Show more comments…
u/pavel

Original runs at 6fps on my machines this runs at 60fps. I lowered the resolution by a quarter (4x perf) and golfed 13 chars to let me declare all vars locally (2x perf).
u/tomxor

wow! this is a massive perf improvement, the original was impressive but I couldn't really see it realtime. Nice one :)
u/katkip

how
u/nender

Wow! This is amazing!
u/sigveseb

Nice!
u/f8f82804

#raytrace #d3 #pbr
u/Cloud

Cool!!!

show FPS hide FPS share 1 remix fullscreen

pavel

remix of d/16169 by u/tomxor

function u(t) {

eval(unescape(escape`𩡯𬠨𫁥𭀠𪐽𝐶𜀰𛁷👣𛡷𪑤𭁨🐹𞐬𦀬𦐬𦠬𪠬𬰽𜐶𞱩𛐭𞱸𛡦𪑬𫁒𩑣𭀨𦀽𪐥𭰬𦐽𪐯𭰬𜐬𛠶𛑚𛱷𚐩𩡯𬠨𪠽𝀬𦠽𭰻𪠭𛐻𚑚𛐽𣑡𭁨𛡨𮑰𫱴𚁘𛐵𜀬𦐯𜠬𦠩𛑳𛑓𚁙𛱳𚱴𚠴𚐪𞀫𠰨𝐪𤰨𦐯𬰫𠰨𦀯𝠩𚐫𝐪𤰨𦀯𬰫𤰨𦠯𬰫𦐯𝠫𭀪𞀩𚐫𭀩𚠵`.replace(/u../g,'')))

Oct 19 2019 4:18 AM UTC

}// 134/140

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

Ray Marching SDF Smoke #improved fps

u/tomxor

huh, did not know about Math.hypot, also it's weird how sensitive V8 is to globals... or rather how it seems incapable of optimising them into locals itself.
u/tomxor

#smoke
u/aleamb

#sdf #raymarching

show FPS hide FPS share fullscreen

pavel

remix of d/701 by u/sigveseb

function u(t) {

for(x[f='fillRect'](i=8,0,2e3,2e3);w=3*i--;)for(x.fillStyle=R(s=666/i,s/2,s/4),k=w*w;b=k--/w|0;a+b&1&&x[f]((a-t%2)*s,(b-2+S(t))*s,s,s))a=k%w

Mar 4 2019 8:47 PM UTC

}// 140/140

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

More layers and a black background #improved

u/sigveseb

Nice!

show FPS hide FPS share fullscreen

pavel

remix of d/12336 by u/pavel

function u(t) {

for(i=t?w=600:a=b=0;i--;x.fillRect(w*b,w-w*a,1,1))[a,b]=[[3.4*a+b/6,a-b,b-a,0][q=Math.random()**t*4|0]/4,[3.4*b-a/6+2,a+b+1,a+b+.5,b][q]/4]

Apr 17 2020 11:24 PM UTC

}// 139/140

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

Barnsley #fern #fractal #leaf #uncompressed

u/pavel

This version is also #improved with a #grow effect and a cap on how dark the image gets if you leave it for a while.
u/Xen

nice!

show FPS hide FPS share fullscreen

pavel

remix of d/7094 by u/AnnanFay

function u(t) {

for(k=c.width|=q=44;k--;x.fillRect(300*(h>0)*h*S(i=k/q)+q*j,99*h*C(i)+1e3*(h>0||h+1)-j*j%300,3,3))x.fillStyle=R(h=(t+C(j=k%q))%2-1,99,k,1-h)

Mar 5 2019 4:48 AM UTC

}// 140/140

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

#improved with fading droplets

show FPS hide FPS share fullscreen

pavel

remix of d/20267 by u/yonatan

function u(t) {

for(m=[i=c.width|=X=Y=0];j=i--/69;)m[i]=[j/5,X-=C(a=j+t<<j+t),Y+=S(a),R(i/8)];for([d,X,Y,x.fillStyle]of m)x.fillRect(960+X*d,540+Y*d,d*=9,d)

Oct 15 2020 7:02 PM UTC

}// 140/140

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

#improved with color and depth

show FPS hide FPS share 1 remix fullscreen

tomxor

remix of d/16174 by u/pavel

function u(t) {

eval(unescape(escape`景爨汥琠堬夬娬眽挮睩摴栽ㄲ〬猽ㄶⱩ㴸攳ⱪ㭩ⴭ㭸⹦楬汒散琨堽椥眬夽椯眬ㄬ⸶ⵚ⼹〩⥦潲⡪㴳ⱚ㵷㭪ⴭ㬩娭㵍慴栮桹灯琨堭㘰ⱙ⼲ⱚ⤭ㄲⵓ⡙⽳⭴⨴⤪㘫䌨㔪匨夯猫䌨堯㘩⤫㔪匨堯猫匨娯猫夯㘫琪㠩⤫琩⨵`.replace(/u(..)/g,"$1%")))

Oct 19 2019 2:09 PM UTC

}// 140/140

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

Ray Marching SDF Smoke #improved resolution

u/tomxor

Exchanged marching depth for resolution... makes it a bit less 3D but a but more smokey i think.
u/tomxor

#smoke
u/tomxor

#raymarching

show FPS hide FPS share 1 remix fullscreen

tomxor

remix of d/18733 by u/joeytwiddle

function u(t) {

D=[5,4,3]
for(i=1e3;i;E=i--%8?E+'X0123456789*/+-&|^~'[(i^i*t)%19]:'')try{D.every((Y,X)=>Y==eval(E))&&(S[E]=1)}catch{}throw Object.keys(S)+E

May 12 2020 11:17 AM UTC

}// 139/140

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

Expression Miner #improved

Show more comments…
u/tomxor

1k tests per frame + variable length + deterministic + keeps solution set
u/tomxor

... +4 chars :P
u/tomxor

Struggling to get it to find anything non linear though e.g D=[0,1,2,4,8]
u/tomxor

#fuzzing
u/joeytwiddle

Great, usable! Off of dwitter, this one generates valid syntax from a grammar: https://github.com/joeytwiddle/dweets-dev/bl…
u/tomxor

Interesting. I once wrote an n-card "24 game" solver which is similar but far more limited in terms of operators - by far the most significant optimization i could find was to combinations based on subexpressions that are equivalent to one already traversed i.e nodes in your AST - maybe that could be applied to yours as well?
u/tomxor

* to prune combinations
u/tomxor

oh and the other fairly decent optimization was pruning combinations based on commutativity of binary operators... i.e another kind of equivalence
u/tomxor

I should clarify: to by pruning I mean not mearly skipping evaluation of individual permutations but to be able to skip entire subtrees of permutations by detecting equivalence at the root of that subtree.
u/joeytwiddle

Pruning does sound sensible, but I'm not sure how to approach it.
u/joeytwiddle

I am also having difficultly with >3 non-trivial outputs. I think the search space is too large. But at least I found some simplifications, such as: [1,3,5,7] => X-~X
u/tomxor

Finally got it to solve a non linear one: D=[2,3,6,11,18,27] (2+X*X), just need a bit more patience

You've reached the end.

dwitter.net | #improved