This program demonstrates 4 different approximate cell decomposition path finding methods. In particular, it demonstrates basic grid decomposition, Quadtree decomposition, hierarchical rectangloid decomposition, and probabilistic cell decomposition. I wrote this program for a 1 semester class, of which it was only a part. Because of this, I wrote much of it under a sever time constraint, so don't expect a whole lot of documentation. The source code is, of course, available (under the LGPL).
I want to post something, so I'll post this little piece of code I made in php. I created a little "Pluralizer" (try the pluralizer here). It's very simple; it takes a singular noun, then returns it's plural. It's based on the algorithm by Damian Conway. See his paper, An Algorithmic Approach to English Pluralization. You can download the source here. The tarball contains: