20-CS-110-001 |
Introduction to Computer Science |
Fall 2010 |
---|

**Glass Rearrangement Puzzle**

Six drinking glasses stand in a row, with the first three full of water and the next three empty. By handling and moving only one glass at a time, how can you arrange the six glasses so that no full glass stands next to another full glass, and no empty glass stands next to another empty glass. What is the minimum number of moves to solve this puzzle? | |

solution |