self Maths Puzzle

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 tothe 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 belowthe top coin (0 = i = 20). We will call this an i-move (thus a 0-move implies doing nothing). The provisois that an i-move cannot be repeated; for example once a player makes a 2-move, on subsequent turnsneither player can make a 2-move. If the gold coin happens to be on top when it's a player's turn thenthe player wins the game. Initially, the gold coinis the third coin from the top. Then find the valid game between alice and bob.
a) In order to win, Alice's first move should be a 1-move.
b) In order to win, Alice's first move should be a 0-move.
c) In order to win, Alice's first move can be a 0-move or a 1-move.
d) Alice has no winning strategy.

Read Solution (Total 3)

self Other Question

.A volume of 10936 l water is in a container of sphere. How many hemisphere of volume 4l each will be required to transfer all the water into the small hemispheres?
a)2812 b)8231 c)2734 d)4222
ABC
*DEF
------------
BFAE
DGFEG
ABCGG
------------
CHGFE
given:C+E=8
each no represent distinct values from 0-9.
find the nos