/prog/ - Barnsley's Fern

Name: Anonymous 2009-06-13 17:31

Minimal Barnsley's Fern (lolwikipedia) in html and javascript:



<html><script>n=u=v=0

function i(){t=document.body.lastChild.getContext('2d')

t.fillStyle='green'

r=Math.random()*99

x=u,y=v

u=x*.85+y/25,v=y*.85-x/25+1.6

if(r<14)u=y/3-x/7,v=x/4+y/4+.4

if(r<7)u=x/5-y/4,v+=1.3

if(r<1)u=0,v=y/6

t.fillRect(50*u+140,525-50*v,1,1)

if(n<2e5)if(n++%99)i()

else setTimeout(i,1)}onload=i</script><canvas height=550></html>

Works on modern browsers (well, ok, works on Firefox and probably Chrome). It's also 348 bytes. Can anyone do better?

Name: Anonymous 2011-12-06 8:05

>>117
An algorithm that solves a problem in nondeterministic polynomial time can run in polynomial time or exponential time depending on the choices it makes during execution.
So if it makes the right choices, it can solve NP-complete problems in polynomial time! Just like infinite compression can compress data infinitely if it happens to be representable in a right way! Javascript is the most awesome language ever, I bet LISP can't be used for solving NP-complete problems!

Barnsley's Fern

1 Name: Anonymous 2009-06-13 17:31

120 Name: Anonymous 2011-12-06 8:05

Name: Anonymous 2009-06-13 17:31

Name: Anonymous 2011-12-06 8:05