In the last post, I mentioned a simple logic puzzle that I’d stumbled over while wandering around the interweb. Start with four glasses, in a row, all upright. The goal is, through a series of moves, to turn them all upside down. On each move, you flip three of the four glasses — up if down or down if up.
The goal is to end up with all four glasses upside-down in the least number of moves possible. It’s not hard to find the solution by trial and error, but it turns out there’s an underlying trick that not only solves it but solves it regardless of the number of glasses (where each move flips N-1).
Bonus: these solutions even look pretty — or at least symmetrical.
Logos con carne 