rootpublicationsbooksphotographs gravity index
    installation photographs

New Masters of Flash:  Volume 3 NMOF3
My contribution to the book was the step-by-step tutorial deconstruction of four advanced ActionScript projects. They fall within topics of Complexity Theory.

ancient one

generative artifacts


The first deconstruction of my chapter is a garden arrangement of classic recursive structures. The structures are similar to trees and have been enhanced to make this representation clearer. Each structure is as unique as a snowflake. They are arranged in a grid so you may observe each individual specimen, or view them as a comparative whole.

open the cdrom and find this tree with leaves and flowers!
Step By Step Instructions.
Step 1, Lola Brine hand draws the eight limbs from which all trees will be composed.


trema discs
trema spikes trema plus
trema O's trema bars

The Trema field is the most straightforward of the chapter's projects. It is a complex graphic construction built from the exhaustive repetition of a simple random step.

21st century paint dripping?
Source Code for EVERYTHING
The Code for this entire project fits on one page (the lower right corner).


factal invader fractal

a fraction of the 32,768 possible invaders

One of my favorite areas of computer science is combinatorics, or the complete manifestation of all possible combinations in a discrete system. Here, I have created a small 15-bit combinatoric system of constructions affectionately called Invaders.

The Invaders in turn occupy Spaceships, that recursive fit into a region, giving the fractal-like appearance of the first image above.

The entire process, from the mathematics of putting together each Invader, to the naming of the layers in the project file, is explained in detail within the pages of the chapter. Variations of the theme exist on the CD-ROM that accompanies the book.

the exhaustive invader army
All 32,768 Invaders
Wow, they really got all of them on one page!



binary network binary network

A binary network is a collection of switches tied together in an ad-hoc network. Each switch can be in one of two states: off or on, charged or uncharged, 0 or 1. A giant system wide clock determines when the nodes change state, and all nodes change state at precisely the same time.

The next state of the switch is determined by the states of the switches it is connected to. The simplest determining rule (and the one applied in the project) works like this:

binary node
If an odd number of connected switches is on, then the switch turns on. If an even number of connected switches is on, then the switch turns off.

I describe not only how to build such a system, but also step through the construction of its visualization as a computational artifact. The tutorial provides all code plus some basic theory and ideas for elaboration.

a day in the life of the binary node
Node Love
Oh, node we love thee.


Commissioning Editor
Steve Rycroft

Graphic Designer and Compositor
Katy Freer

Technical Editors
Matthew Knight
Steve Rycroft

New Masters of Flash Volume 3 , paperback
477 pages | 1st edition | Friends of Ed

own it

commercial free open source since 2012 spread the love