hi
I saw the following problem at a cometetion link :
http://itbhu.ac.in/codefest/problem.php?pid=14
Pls help...
Statement
Alice and Bob play a unique gambling game at a casino. A row of
casino chips (tokens) is placed at the Casino table.The players play
alternate turns. In a turn a player can take a chip from any end of the
row (two choices).
Assume that you are given an initial configuration of the chips alongwith their
denominations and Alice starts the game.
Alice wants to acquire maximum possible amount irrespective of the strategy Bob
plays with.
Design an Algorithm to calculate the maximum amount that Alice can definitely
acquire.
and please explain too...
Thanks..
RegardsAmit
Your Mail works best with the New Yahoo Optimized IE8. Get it NOW!
http://downloads.yahoo.com/in/internetexplorer/
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
