New Monthly Contest!

This is a discussion on New Monthly Contest! within the Contests Board forums, part of the Community Boards category; I took the problem to mean "Based on the current set, give yourself the best move you can make at ...

  1. #46
    ATH0 quzah's Avatar
    Join Date
    Oct 2001
    Posts
    14,826
    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.
    Hope is the first step on the road to disappointment.

  2. #47
    S Sang-drax's Avatar
    Join Date
    May 2002
    Location
    GŲteborg, Sweden
    Posts
    2,072
    Quote 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.
    Last edited by Sang-drax : Tomorrow at 02:21 AM. Reason: Time travelling

  3. #48
    Registered User
    Join Date
    Mar 2005
    Posts
    36
    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. #49
    Cheesy Poofs! PJYelton's Avatar
    Join Date
    Sep 2002
    Location
    Boulder
    Posts
    1,728
    Since nobody else entered, go ahead and send the code to me.

  5. #50
    Cheesy Poofs! PJYelton's Avatar
    Join Date
    Sep 2002
    Location
    Boulder
    Posts
    1,728
    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. #51
    Registered User
    Join Date
    Aug 2004
    Location
    San Diego, CA
    Posts
    313
    Quote 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?

Page 4 of 4 FirstFirst 1234
Popular pages Recent additions subscribe to a feed

Similar Threads

  1. May Monthly Contest Results
    By PJYelton in forum Contests Board
    Replies: 28
    Last Post: 05-27-2005, 01:43 AM
  2. May monthly contest
    By PJYelton in forum Contests Board
    Replies: 43
    Last Post: 05-18-2005, 06:37 PM
  3. Results of March Monthly Contest
    By PJYelton in forum Contests Board
    Replies: 23
    Last Post: 04-17-2005, 09:46 AM
  4. WANTED: Contest Master
    By kermi3 in forum A Brief History of Cprogramming.com
    Replies: 15
    Last Post: 01-23-2003, 09:15 PM

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21