It was tested listening mostly to:  “The Exploding Psychology”

Edit: Will not work in IE for reasons unknown to me. Get a real browser
I will embed a default tune in future experiments

I plan on doing (many?) more of these in the future. I also plan on making them (much?) more interesting. For now this is a decent proof of concept.

	function onEnterFrame(e:Event) {
		SoundMixer.computeSpectrum(byteArray, false);

		var drawCanvas : Shape = new Shape();

		var matrix = new Matrix();
		matrix.createGradientBox(768, 1);

		drawCanvas.graphics.lineStyle(1);
		drawCanvas.graphics.lineGradientStyle(GradientType.LINEAR,
			[0x005599, 0x8888FF, 0x005599],
			[0, 1, 0],
			[0, 128, 255],
			matrix);
		drawCanvas.graphics.moveTo(0, 160);

		for (i in 0...256) {
			var t:Float = byteArray.readFloat();

			var controlX = i*3;
			var controlY = 0 + 160;

			var xx = (i + 1) * 3;
			var yy =  t * 200 + 160;

			drawCanvas.graphics.curveTo(controlX , controlY, xx , yy);
		}

		bitmap.bitmapData.applyFilter(bitmap.bitmapData, bitmap.bitmapData.rect, new Point(), blurFilter);
		bitmap.bitmapData.draw(drawCanvas,new Matrix(),colorTransform);
	}

Click to visit tutorial

The funny thing is that after creating said app I needed to authorize it.. And it actually took me a second to click the ‘allow’ button…

Click to visit project page and try demo

But hey.. you wouldn’t know it yet but this IS supposed to be a procedural generation blog

Features (If they can be called that)

• Setting and visualization of all perlin noise parameters in real time
• Offset animation
• Merging of 3 separate noise patterns for complex perlin effects
• Randomize button so you don’t have to deal with my Ui

A pretty dang fast and flexible port of this: A-Star (A*) Implementation in C#.
Still needs some work but I’m happy with the current results.

Features

• Weighted nodes
• Choice of allowing or not allowing diagonal movement
• Choice of adding ‘weight’ to diagonal moves to deter from using them
• Choice of punishing any change in direction to promote straight paths when possible
• Implementation of a ‘ Tie Breaker ‘
• Multiple built in heuristic methods
• Possibility of limiting the nodes the pathfinder may test (returning no path when the limit is reached)