April 29th, 2003

(no subject)

I got a program working that finds solutions to the palindrome problem. It's not very optimal, though; the length of the solutions varies widely, depending on the initial word choice. Here's the shortest one I've gotten so far:

burdens emetic lack loftily adze egg ottava daman upbow son ihram oxymora fug akee jaw aba dial op mihrab spud nihil eristic att aqua eau qat tacit sire li hind ups bar him pol aid ab awa jee kagu faro myxoma rhino swob pun amadavat tog geez daylit folk calcite mesne drub


I think I might be making local optimizations at the expense of overall optimizations, but I'm just too stupid to know for sure. I picked up a book that I hope will help me figure it out.