Interested to Buy Any Domain ? << Click Here >> for more details...
Alice and Bob play the following coins-on-a-stack game. 20
coins are stacked one above the other. One of them is a
special (gold) coin and the rest are ordinary coins. The
goal is to bring the gold coin to the top by repeatedly
moving the topmost coin to another position in the stack.
Alice starts and the players take turns. A turn consists of
moving the coin on the top to a position i below the top
coin (0 = i = 20). We will call this an i-move (thus a 0-
move implies doing nothing). The proviso is that an i-move
cannot be repeated; for example once a player makes a 2-
move, on subsequent turns neither player can make a 2-move.
If the gold coin happens to be on top when it's a player's
turn then the player wins the game. Initially, the gold
coinis the third coin from the top
- 7 Answers
- 25518 Views
- TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / abhishek
if Alice takes 0: then 2 coins left over gold, now B takes
>=2 then 1 coin left above gold..Alice cannot take 0..any
other will make the gold at top. so not 0
If alice takes 1 at first then 2 coins left. . now B can
take 0 or anything >=2.
If B takes 0,then no change..now A takes 2 leaving 1 coin
above gold..what ever b takes A wins.
If B takes 2 then one coin left above gold then A takes
zero.. now what ever B takes A wins
So 1 first
| Is This Answer Correct ? | 20 Yes | 0 No |
Answer / teena
alice can take either a 0move or a 1 move.
initially if alice take 0 then bob take 1.. which means there are still 2 coins above the gold coin... the same is true when alice takes 1 and bob take zero...
after this alice choise must be 2.. so there is one coin above the gold coin... so then watever choice bob makes brings the coin to position 1...
ao alice is the winner
| Is This Answer Correct ? | 29 Yes | 13 No |
Answer / sarath chandra
Case 1:suppose Alice starts with a 0 move.Now bob cleverly
goes for a 2 move so that there is only one coin above the
gold coin.Now irrespective of alice's move Bob wins.
Case 2:suppose alice stats with a 1 move it barely makes any
difference.Again Bob goes for a 2 move and he wins.
So alice has no winning strategy at all.Hence
pavan got it right
| Is This Answer Correct ? | 15 Yes | 10 No |
Answer / adarsh j
Answer is if alice start with 1 then it is correct bcoz
if alice starts wid 1 thn bob choses 2
then he wid 3 bob choses 4
aslike.
.
.
.
.
.
.
.
.
.
.
.
.
..
atlast alice gets the gold coin
| Is This Answer Correct ? | 13 Yes | 20 No |
Answer / pavankumar srikanta
there is no winning strategy for Alice.
| Is This Answer Correct ? | 24 Yes | 34 No |
g[0]=1,g[1]=-1,g[n]=2*g[n-1]-3*g[n-2] then calculate g[4]= ?
A lady has fine gloves and hats in her closet- 13 blue, 27 red, and 40 yellow. The lights are out and it is totally dark. In spite of the darkness, she can make out the difference between a hat and a glove. She takes out an item out of the closet only if she is sure that if it is a glove. How many gloves must she take out to make sure she has a pair of each color?
a person is doing job from his earning he spents1/4 th of the salary for travelling,1/5 for his personal expenses.and rs 50 he will be depositing in the bank.what is his total salary?
3 angles or 3 sides r given. Which will form a triangle?
Out of 10 white, 9 black and 7 red balls, in how many ways can we select one or more balls please with solution.
Hi... can anyone send me punjab national bank (Management Trainee) model paper. My mail-id chithra.sundramurthy@gmail.com
TELL ME A FIVE DIGIT NUMBER WHEN DIVIDED BY 2 TO 10 REMAINDER IS 1 AND WHEN DIVIDED BY 11 REMINDER IS 0. i.e.., FIVE DIGIT NUMBER DIVIDED BY 2 GIVES REMINDER OF 1, FIVE DIGIT NUMBER DIVDED BY 3 GIVES REMINDER OF 1 AND SO ON TILL 10, THEN THE SAME FIVE DIGIT NUMBER DIVIDED BY 11 GIVES A REMINDER OF ZERO.
45% of 1500 + 35% of 1700 = ?% of 3175 (a) 40 (b) 55 (c) 45 (d) 35 (e) None of these
You have two jars, 50 red marbles and 50 blue marbles. A jar will be picked at random, and then a marble will be picked from the jar. Placing all of the marbles in the jars, how can you maximize the chances of a red marble being picked? What are the exact odds of getting a red marble using your scheme?
2 Answers Altera, Microsoft, SikSoft,
A, B ans C are three speakers. They have to speak randomly along with another 5 speakers in a function. A has to speak before B and B has to speak before C. What is the probability.
success is to failure, joy is to ?
20 people meet and shake hands. The maximum number of hand shakes possible if there is to be no ‘cycle’ of handshakes is( a cycle of handshake is a sequence of people a1,a2, …..ak)such that people(a1,a2),(a2,a3)…..(a(k-1),ak),(a2,a1) shake hand is
English 
