Journal!

int bnew, bold;

bNew = bOld + growRate * bOld * ( 1 - bOld);

bnew = BNBRS(bold); /* Find all nbrs of posns in  bold, put in bnew */

bnew = bold + e = [– 1 0 0] = b(1)

b_new = b_old - a_old > 0

Advanced Enterprise Research Office

I spent the weekend hacking together a contribution to a 48-hour video game competition with toby. We datamoshed quake3 using quartz composer… here’s an early video, we got it better before the final deadline; technical details and follow up at this project page:

Advanced Enterprise Research Office from Sundialtone on Vimeo.