 |
| Register | Login | |||||
 |
Main
| Memberlist
| Active users
| Calendar
| Chat
| Online users Ranks | FAQ | ACS | Stats | Color Chart | Search | Photo album |
|
| | ||
|
| Register | Login | |||||
|
Main
| Memberlist
| Active users
| Calendar
| Chat
| Online users Ranks | FAQ | ACS | Stats | Color Chart | Search | Photo album |
|
| | ||
| Acmlm's Board - I3 Archive - - Posts by ||bass |
| Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
| User | Post | ||||||||||||||||||||||
|
||bass Administrator                  Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Get a 3rd party NNTP timesync program and set it to run every 5 minues. | |||||||||||||||||||||||
|
||bass Administrator  Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| A sequence of 10 pegs (or coins) is placed in a single row randomly e.g., 5 1 3 7 0 4 2 9 8 6. Each peg has a value between 0 and 9. There is a peg for each value. Each player removes a peg from either the left or the right end of the row. After all pegs have been collected (each player takes 5) the winner is the one that collected the pegs with the highest total value.
Find a strategy guarinteed to win. (It may be for either player.) (There is an answer.) |
|||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
Originally posted by That Break GuyThat method for solving is an exponential angorythim. There is no way you could formulate that strategy for ALL possible games in a single post. The winning strategy has to be a linear algorithim. Furthermore, I don't think you seem to understand the rules of the game. On a player's turn, he can pick from either side. The side you pick on one turn doesn't have to be the same side you pick on the next turn. The "correct" answer can be done on a single sheet of paper, even if you incresed the number of pegs to 100 pegs. PS: Your answer is also wrong. (edited by ||bass on 12-01-05 11:41 AM) (edited by ||bass on 12-01-05 11:45 AM) (edited by ||bass on 12-01-05 12:15 PM) |
|||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| People keep asking me how this is possible if you can't see the values of the pegs. You CAN see them. Read the damn question people. I NEVER said you can't see the values of the pegs. You can. | |||||||||||||||||||||||
|
||bass Administrator  Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Your algo plays a SMART strategy but not an unbeatable one. One could construct very specific arrangements of pegs that would defeat this algorithim. There is an answer that works for 100% of all possible arrangements of pegs and it's a MUCH simpler algo, you could do it in under 10 lines easily. | |||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Hint time: The correct answer will work for any even number of pegs. | |||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Hint 2: The "correct" soloution looks at all the pegs before the game starts, and then ignores them for the rest of the game. | |||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
Begin by seperating the series into sets A and B, alternating as shown. Sum the values of all the integers in each set. In this example, A is 25 and B is 20. Clearly you want to have the elements in set A. Draw from set A (the left). Your opponant is now forced to draw from set B. When your opponant draws, he opens up another element of set A for you to draw. Draw the open element from set A. Repeat this process until all elements have been drawn. This method is guarinteed to win 100% of the time for all arrangements of pegs. |
|||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| You people need to learn how to read. The question explicitly states that the strategy may be for either player. In this case, it was the first player. | |||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Ok. Since you all did so poorly on the last question. I've decided to have a much easier question this time.
The Coin Game: The rules are as follows The game has 2 players, alternating turns. You begin with a pile of 40 coins. On each turn, a player may remove 1,2 or 4 coins. The player to remove the LAST coin wins. Find a strategy that is guarinteed to win for the FIRST player. |
|||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Ok. That was better then last time.
drizzt do'urden's answer is WRONG for making assumptions about things I didn't mention in the question. Cellar Dweller's answer is CORRECT. The proper strategy is to, on your turn, always return the coin count to a multiple of 3 by drawing however many coins are required to do so. |
|||||||||||||||||||||||
|
||bass Administrator  Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Ok. In accordance with Google policy, we're not allowed to even ASK members to click on the google ad links. Clicking on the links is 100% optional. If you don't like the ad's, just ignore them. They're all the way at the bottom anyway. | |||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| Seriously. With the amount you people are bitching about it.... you're acting like we just added popups or something, seriously.
It's a single ad block at the DEAD ASS BOTTOM of the screen. |
|||||||||||||||||||||||
|
||bass Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days |
| ||||||||||||||||||||||
| If you notice, most of the ads HERE are selling videogames and anime. I'd say that's pretty good targeting. | |||||||||||||||||||||||
(restricted)|
||bass |
Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days
|
http://aftermath.dyndns.org:8888/~aimadhack/
|
People who use anything else just haven't been paying attention.
||bass |
Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days
|
Electronics DO have a minimum operating temperature.
|
Anything below that temperature can cause both condensation AND/OR a situation where components have less electrical resistance then they should. (restricted) |
||bass |
Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days
|
Only one person in this thread so far has even really even mentioned the fact that even if there was a fully functional 360 emulator, your computer would probably run it at 10fps.
|
The graphics card you would need to properly emulate an xbox 360 would cost you more then an actual xbox 360.
||bass |
Administrator Since: 11-17-05 From: Salem, Connecticut Last post: 6297 days Last view: 6296 days
|
Allow me to plug C# for a moment.
|
It has almost all the flexibility and strength of C++ without all those nasty heap pointer management issues. | ||||||||||
| Pages: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 |
| Acmlm's Board - I3 Archive - - Posts by ||bass |
