There is just one way to go from XXXXOOOO to XOXOXOXO in five moves if *three* adjacent coins are moved at each turn. How?

(In reply to All the little solutions by owl)

The lesser the moving turn is, the better the answer values. Thus, why not challenge the more

complex problem?

There is  solvable to go from (N of X, if N>=3) XXXXOOOO (N of O) to XOXOXOXO (N

pairs of XO or OX) in N moves if *three*  (or *two*, another proved problem) adjacent coinsare

moved at each turn. How?

Posted by Martin Chiu on 2005-12-01 12:00:33