OpenEuphoria

Re: Robert...EDS - questions/comments

• Posted by Michael Sabal <mikes at notations.com> Feb 12, 2001
• 436 views

Could I see your compare routine?  Maybe there's a way to sort the data so =
150K~1M compares aren't necessary.  (NB: the sort routine could be run =
when Tiggr recognizes she's the only one in the room.  The learning may be =
a bit slower if there is significant lag between updating the DB and =
sorting it; but then a priority level could be assigned to that task to =
let it be done more often.) =20

Just a thot....

Michael J. Sabal

>>> gertie at PELL.NET 02/12/01 04:06PM >>>
I have a problem that can only be solved with brute force, since it =
involves comparisons=20
with 150,000 words, minimum,,, and if that works out, it could be expanded =
to a=20
million.