| T.R | Title | User | Personal
Name | Date | Lines |
|---|
| 1114.1 | | 4GL::GILBERT | Ownership Obligates | Thu Aug 24 1989 11:43 | 5 |
| We had a previous problem like this (though I think it may have
been smaller), which was solved with (methinks) FoxGlove, an AI
language derived from LISP.
I'll search for it.
|
| 1114.2 | 20 * 2 > 32 | DWOVAX::YOUNG | We're no worse than anyone else. :-( | Sun Aug 27 1989 19:03 | 22 |
| The problem as stated can NOT be done:
With 32 players there are 31 potential opponents for each player.
Each week a player will use up 2 more of their potential
opponents.
Therefore after 15 weeks there will be only one potential opponent
left, not enough for another week of play.
20 weeks is clearly impossible under these rules.
The maximum number of weeks for these rules is :
[ (Number of players - 1) / 2 ]
For 32 players this is 15 weeks (for 28 players it is 13 weeks).
It is pretty easy to solve this for 8 weeks. 12 weeks with a little
more trouble. 15 weeks I am not so sure how to solve, but it should be
possible.
-- BArry
|
| 1114.3 | Is there a solution? | ELIS::BUREMA | Elen s�la lumenn omentilmo | Fri Jun 14 1991 03:44 | 9 |
| Re: .1 and also my note 1304
Did anyone ever find the solution to this problem? I have developed
some algorithms for this problem, but they have runtimes of O(N!), so
they are only usable for small N. This same problem is also addressed
in the algorithms conference but the algorithms posted there are still
O(N!)... 8-(
Wildrik
|