jamis

# --------------------------------------------------------------------
# An implementation of the "Growing Tree" algorithm. This one is
# notable for it's ability to become nearly identical to Prim's
# algorithm, or the Recursive Backtracking algorithm, depending on
# how the cells are removed from the list that aggregates as the
# algorithm runs.
#
# This script allows you to play with those settings by specifying
# the mode after the width and height parameters, as "random" (pull
# the cell from list at random), "newest" (pull the newest cell),

defunkt

# Video: http://rubyhoedown2008.confreaks.com/08-chris-wanstrath-keynote.html

Hi everyone, I'm Chris Wanstrath.

When Jeremy asked me to come talk, I said yes.  Hell yes.  Immediately.  But
then I took a few moments and thought, Wait, why?  Why me?  What am I supposed
to say that's interesting?  Something about Ruby, perhaps.  Maybe the
future of it.  The future of something, at least.  That sounds
keynote-y.