code:

---

010:angries earings erasing gainers graines
    reagins regains reginas searing seringa
010:angriest astringe ganister gantries granites
    ingrates rangiest reasting stearing tasering
010:easting eatings gainest genista ingates ingesta
    seating tangies teasing tsigane
010:ester reest reset retes steer stere teers teres
    terse trees
010:estrin inerts insert inters niters nitres sinter
    strine triens trines
010:lapse leaps pales peals pelas pleas salep sepal
    spale speal
011:anestri antsier nastier ratines resiant retains
    retinas retsina stainer starnie stearin
011:palest palets pastel peltas petals plaste plates
    pleats septal staple tepals
012:least leats salet setal slate stale steal stela
    taels tales teals tesla
013:alerts alters artels estral laster rastle ratels
    salter slater staler stelar talers tarsel
013:apers apres asper pares parse pears prase presa
    rapes reaps spaer spare spear
013:arets aster earst rates reast resat stare stear
    strae tares taser tears teras

---

So, if these were to be taken into consideration and the anagram_test
script were to be changed to use one of these, then the final scores
would be somewhat changed because the final set of codes
(after CHR($d) changed into $d) won't work with these...

If someone wants the perl code to play around (and yes, I know this
is not a perl BB, but this kind of script would have taken me AGES
to do in KiXtart!), please let me know and I'll post it. On my PC
(a PIII@1.100MHz with 512MB) only takes 11 seconds to read in the
263.000+ words file and put out the 20.639 possible anagrams!

You can even use it just to look for anagrams for a given word, or
restrict anagrams only for words between x and y characters, based
on the dictionary provided. (And, of course, you can use your own
dictionary!)

Also, back to the contest, where it says:

quote:

---

463 = Fernando Madruga

---