1. I took the problem to mean "Based on the current set, give yourself the best move you can make at this time." To which, what I mentioned was true. With the information you know, you are making the best possible move for the available ranges. (Looks back at problem description...) Ah. see I was assuming an unknown number of guesses after you. In which case, the "split the biggest" would give you a best case scenario.

Actually, if you go first, you're screwed anyway unless there are only 2 people playing. I can't picture a scenario where the first player has a good chance to win, other than a 2 player game.

Anyway, I was thinking of it as not knowing how many people were possibly going next.

Quzah.

2. Originally Posted by quzah
Actually, if you go first, you're screwed anyway unless there are only 2 people playing. I can't picture a scenario where the first player has a good chance to win, other than a 2 player game.
According to the rules of this game, you'll have 50% chance of winning if you go first in a 3 player game. If you choose 75, player 2 will choose 25 and player 3 26.

3. Did anyone ever send a solution to the 3rd problem? If not, I have one working. I'm just not happy with the time it spends on (1000,[],2) and a couple others I have tried which still fit within the rules. (I am presuming the range ^ numafter < 1000000 is really <=).

Just to prove it works, for (477,[11,33,57,239,400],3) yields 148, and
(477,[11,33,57,239,400],4) yields 319. (With only one following, its 80.)

4. Since nobody else entered, go ahead and send the code to me.

5. Sorry this has taken so long to grade guys, I've been writing a program for work that has taken a considerable amount of my free time. Hopefully I'll have the results as well as my personal solutions this weekend.

6. Originally Posted by PJYelton
Sorry this has taken so long to grade guys, I've been writing a program for work that has taken a considerable amount of my free time. Hopefully I'll have the results as well as my personal solutions this weekend.
It's alright. You don't see posts piling up on this board, do ya?