~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-

Tetris Tile Trees / 2009-12-26

~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-~-

Right when I was about to start working on a major improvement to the Mandelbrot program, I was struck with an itch to write a JavaScript applet that takes an arbitrarily shaped grid and tries to tile it with tetris pieces, using standard techniques for traversing search trees. So here it is.

I think it turned out pretty well for the amount of time I put into it. There’s at least one more significant optimization I hope to make, which takes advantage of the fact that connected components are independent.

So that’s all.

--------------------

:::Comments:::