Turing Google Doodle

[Tomsk]

Before the puzzles, the Google doodle just counts up in binary.

So far it's up to 9 bits.

Anyone know how many bits it will go up to?

 

[pete248]

I'm not sure how many it'll go up to if it's automatic, but i'm trying the puzzles to light up the Google logo now

 

[int]

Completed the puzzle after 5 minutes of confusion!

 

[RomanNose]

This is quite a good video.

 

[Redman]

This is quite a good video.

I enjoyed that, thanks for posting it

 

[Sin_Chase]

Great little puzzle!

 

[ikillbears]

i thought this was going to cause me a lot of pain and annoyance. luckily it didn't. was quite a nice little doodle

 

[Fire_fly]

I spent a few minutes playing with it earlier. I still don't fully understand how it works even though I completed all of the puzzles.

 

[yoyo50]

His love of apples killed him

 

[SoundsGood]

edit: tasteless joke withdrawn

 

[Sin_Chase]

I spent a few minutes playing with it earlier. I still don't fully understand how it works even though I completed all of the puzzles.

The right/left arrows move the square selector through the binary code.

The Down/Up arrows are If Then checks. If you set the down/up arrow to an empty value nothing is compared and no action is taken. If you set a 1 or a 0 and it matches the bit currently selected by the square selector then the 'code' follows the path it points to.

The refresh button like arrows are loops, number of times is indicated by the small circles inside the arrow.

The 0/1 big circles change the bit to either a 1 or 0. Some of these are toggles so you can set the bit to either.

The aim is to look at the 'code', change the If Thens and bit change toggles in order to match the binary code to the one in the top right as the 'code' runs through and changes the binary code in your selector.