Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^7: Puzzle: Given an array of integers, find the best sequence of pop / shift...

by davidj (Priest)
on Mar 20, 2006 at 14:01 UTC ( #537945=note: print w/ replies, xml ) Need Help??


in reply to Re^6: Puzzle: Given an array of integers, find the best sequence of pop / shift...
in thread Puzzle: Given an array of integers, find the best sequence of pop / shift...

Sure the 2nd player will take the higher of the two. But that is irrelevant, because that player can be forced to take all odd or all even. With that, the outcome is known in advance, and the first player will know which one (odd or even) to take for herself.

dave
  • Comment on Re^7: Puzzle: Given an array of integers, find the best sequence of pop / shift...

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://537945]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (3)
As of 2016-07-24 04:35 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    What is your favorite alternate name for a (specific) keyboard key?


















    Results (221 votes). Check out past polls.