Sixteen coins are arranged in a row on a table such as first coin has its head side up the second- tail and it continues in this alternate pattern till the last coin. In a single move you are permitted to select an arbitrary sequence of adjacent coins and to replace each head facing coin to tail and each tail facing coin to head.
determine the minimum number of moves such that all 16 coins are tail side up.
Answers
Answered by
0
Answer:
9tail problity. jhcccvgv
Similar questions