Welcome to the Monastery | |
PerlMonks |
Re^6: Puzzle: Given an array of integers, find the best sequence of pop / shift...by McDarren (Abbot) |
on Mar 20, 2006 at 12:53 UTC ( [id://537931]=note: print w/replies, xml ) | Need Help?? |
Okay, I understand what you are saying - but I'm still not sure if I buy it. Isn't this mistakenly assuming (like I did in my original reply) that each player (or at least player 2) will take the highest of the two available numbers at each turn?
In Section
Seekers of Perl Wisdom
|
|