Aspire Faculty ID #16609 · Topic: NIMCET 2008 · Just now
NIMCET 2008

Three Gold (G) coins, three Silver (S) coins and three Copper (C) coins are arranged in a single row as follow:
G S C G S C G S C

Only 2 adjacent unlike coins can be moved at any one time.
The moved coins must be in contact with at least one other coin in line.
No coin pairs can be reversed.
What is the minimum number of moves required to get all the coins in following order?
C C C S S S G G G

Solution

Given restrictions allow only adjacent unlike-pair shifts without reversing order.
Step-by-step optimal shifting gives minimum 8 moves.

Previous 10 Questions — NIMCET 2008

Nearest first

Next 10 Questions — NIMCET 2008

Ascending by ID
Ask Your Question or Put Your Review.

loading...