yes it does show you, but it starts with the two outside cups down and the middle one up and when we start the two outside ones are up and the middle is down.

so all we need to do is get the 2 outside ones down and middle up then swap the right w then the outside ones then the left 2 and then the outside ones again!

It is possible for any value of N, to enumerate the 2-to-the-N possible binary numbers of N bits such that we change exactly one bit when moving from one number to the next.

For the case N=3, the Gray code is as follows:
000, 001, 011, 010, 110, 111, 101, 100

The practical uses of Gray code are outlined better on wikipedia than I could hope to do here, but I suppose you're wondering how that all relates to this puzzle? Well, here, we are looking for a sequence that changes exactly two bits every time.

When changing two bits at a time, this set falls into two halves: the first half is 000, 101, 110 and 011; and the second is 111, 010, 001 and 100. It's impossible to get between the two sets changing two bits no matter how many times you make the change. This puzzle works, as Martbowski has pointed out, by displaying you a starting position of 010, demonstrating how to get to 111, and then changing the start position to 101 (which is in the other half of the set).

## I'm a god.

I don't need further proof.

## I'm not gonna argue with that

## And you're right

to do so...

## Yargh!

They keep finishing upside down! The cuppy bastards.

## Haha!!

the cuppy bastards! lol!

## Hehe

well i cannot find a way...i was trying for a good 37 minutes...hence lack of posting

## I'm more intrigued

by the advert for the "Diva Mesntrual Cup" at the bottom.

NO MORE TOXIC SHOCK!

HOORAY!

## It's about time

## Yeah

frankly I've had it up to here with toxic shock.

## Ooooh a development on the cups!

yes it does show you, but it starts with the two outside cups down and the middle one up and when we start the two outside ones are up and the middle is down.

## ^^^^

so all we need to do is get the 2 outside ones down and middle up then swap the right w then the outside ones then the left 2 and then the outside ones again!

## Fantastic game...i love it!TANKS !!

and things that look like apache's...good stuff.

## or a lynx

## Then may I recommend some

period blood?

## No you may not

I blame the Muslims.

## it's scientifically impossible

seriously.

i got a scientist to prove it and everything.

## bullshit

i hate this. its impossible.

unless theres another cup on that page?

## hmm good idea but i dont think so

they do say get all three cups to end upwards...but maybe.

## show us then?

i hate magicians

## WE NEED TO KNOW! YOU MUST TELL US!! THE ORDER!

## No...come one pleeease!

## See now i thought that and said it above

but i thought there was actually a way....i wish there was.

## Thanks Mart

nice to know you care

## chris_is_code

This is actually a fun trick that is related to Gray Code (http://en.wikipedia.org/wiki/Binary_Gray_sequence)

It is possible for any value of N, to enumerate the 2-to-the-N possible binary numbers of N bits such that we change exactly one bit when moving from one number to the next.

For the case N=3, the Gray code is as follows:

000, 001, 011, 010, 110, 111, 101, 100

The practical uses of Gray code are outlined better on wikipedia than I could hope to do here, but I suppose you're wondering how that all relates to this puzzle? Well, here, we are looking for a sequence that changes exactly two bits every time.

When changing two bits at a time, this set falls into two halves: the first half is 000, 101, 110 and 011; and the second is 111, 010, 001 and 100. It's impossible to get between the two sets changing two bits no matter how many times you make the change. This puzzle works, as Martbowski has pointed out, by displaying you a starting position of 010, demonstrating how to get to 111, and then changing the start position to 101 (which is in the other half of the set).

Fun huh?

## I lost all understanding of that

on line 6

## Oh well

It's effectively this:

http://www.drownedinsound.com/articles/1877287

:)

## Ah very clever

it's as clear as day now

## Was

meant to link to Martbowski's 'Are you a simpleton' post, but in a case of poetic justice I fucked the link.