I've always thought that the simple bubble algorithm was amazing. I mean, if you weren't worried about wearing out the relays, and time weren't a factor, you could simply test every possible combination of L and C, and re-order them in pairs until the best combination bubbles to the top. This somewhat crude, but simple algorithm was used to alphabetize lists in Basic programs written since Basic was invented. It ought to be possible to program a variant which would use a simple sampling list of 50 combos to get a few "dips" , bubble them for best SWR, take that LC combo and then test the nearest, say 100 combinations, plus and minus these settings to maximize with a bubble test to find the best match. Explain to me, without telling me how dumb I am, why this won't work.
Preston Douglas WJ2V _______________________________________________ Elecraft mailing list Post to: [email protected] You must be a subscriber to post to the list. Subscriber Info (Addr. Change, sub, unsub etc.): http://mailman.qth.net/mailman/listinfo/elecraft Help: http://mailman.qth.net/subscribers.htm Elecraft web page: http://www.elecraft.com
