perplexus.info :: General : Three at a Time

Three at a Time (Posted on 2004-10-26)

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

See The Solution Submitted by Brian Smith

Rating: 3.5000 (4 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

No Subject

| Comment 22 of 23 |

Actually, only n is an odd integer (except 1) and 4 are solvable.

[for move three adjacent]

Posted by Martin Chiu on 2005-12-05 13:48:37

Please log in:

Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info