Tony, here's a simpler version of the Recursive Elimination Supervisor, based on a suggestion of yours. Step 1. Use the seed method in reverse to find the "Seed Loser" SL, from among the N candidates. Step 2. While the SL sits out, recursively supervise the seed method to find an N-1 stage recursive winner RW from among the N-1 remaining candidates. Step 3. Compare SL and RW directly. Whichever is better is the N stage recursive winner. In case of a tie between these two, choose RW. Forest
- [EM] Recursive Elimination Supervisor Forest Simmons
- Re: [EM] Recursive Elimination Supervisor Forest Simmons
- Re: [EM] Recursive Elimination Supervisor Forest Simmons
- [EM] Recursive Elimination Supervisor Tony Simmons
- Re: [EM] Recursive Elimination Supervisor MIKE OSSIPOFF