Archives for March 2007

bleed code

I seem to bleed code. When asked a question or confronted with a problem, I almost immediately try and get a computer to do it for me. This is a useful instinct because it helps sharpen all my abilities and whatnot, but it turns out to not be the point of graduate school. In grad [...]

super sudoku

We define a super sudoku to be a sudoku with extra constraints. If we divide a sudoku board of size 3^2 * 3^2 into “fat rows” and “thin rows” and “fat columns” and “thin columns”, then it takes 4 coordinates to uniquely address a square on the board, so a square’s coordinate will be (fat [...]

Graph covering with shortest paths

I just recently gave a presentation at 38th Southeastern Conference on Combinatorics, Graph Theory, and Computing all about the computational issues of covering a graph using shortest paths emanating from a particular vertex. It was fun research to do, and the conference was really interesting. I’ve realized that I, like many of my friends, kind [...]

Tierra

Tierra is one of the first A-Life systems. Programs in Tierra evolve and breed and compete for CPU time and memory space. It’s pretty cool, and it’s one of those things that I read about as a youngster and made me think computers were awesome. Fortunately, I got to give a presentation on it to [...]