/**
* Copyright yonatan ( http://wonderfl.net/user/yonatan )
* MIT License ( http://www.opensource.org/licenses/mit-license.php )
* Downloaded from: http://wonderfl.net/c/aqxd
*/
// forked from Quasimondo's forked from: forked from: forked from: 10 PRINT CHR$(205.5+RND(1)); : GOTO 10.
// forked from Quasimondo's forked from: forked from: 10 PRINT CHR$(205.5+RND(1)); : GOTO 10.
// forked from Quasimondo's forked from: 10 PRINT CHR$(205.5+RND(1)); : GOTO 10.
// forked from Quasimondo's 10 PRINT CHR$(205.5+RND(1)); : GOTO 10.
// A Flash version of the classic 10 PRINT CHR$(205.5+RND(1)); : GOTO 10.
// inspired by http://www.bogost.com/blog/talk_of_10_print.shtml
// and https://forum.processing.org/topic/challenge-processing-variations-of-10-print-chr-205-5-rnd-1-goto-10
//
// The challenge is to get the labyrinth look by using as little code as possible
// Of course the biggest problem here is all the boilerplate stuff.
// Feel free to create a shorter one.
//
// Author: Mario Klingemann
//
// v3: shaved off even more chars
// v4: I just saw in Yonathan's code that a conditional is actually shorter than the array construction, so I stole that one ;-)
// v5: This one could even be shorter by not using Math.tan, but I wanted to maintain a quasi-random look
package{import flash.display.*;public class Q extends Sprite{function Q(){var a=0,b=4,r,g=graphics;g.lineStyle(0);addEventListener("enterFrame",function(){r=(Math.random()*2&1)*8-4;g.moveTo(a,b+r);g.lineTo(a+=8,b-r);b+=a>>8<<3;a&=0xff})}}}