Click here to Skip to main content
Click here to Skip to main content
Technical Blog

Tagged as

Alan Turing - Google Doodle Solved

, 25 Jun 2012 CPOL
Rate this:
Please Sign up or sign in to vote.
Google, breaking the pragmatism of creating artistic doodles, has showed up a geeky doodle which is a gate way to Google search results for the greatest mathematician, natural code breaker Alan Mathison Turing who with his inventions laid the strong foundation for modern computing world. The " Alan

Google, breaking the pragmatism of creating artistic doodles, has showed up a geeky doodle which is a gate way to Google search results for the greatest mathematician, natural code breaker Alan Mathison Turing who with his inventions laid the strong foundation for modern computing world. The " Alan Turning Doodle " which is showed  up on Google's home page today is a tribute this ingenious.

I didn't care much to solve this doodle for the first couple of Google searches that I made today, but each time I opened Google's home page, it was be-knocking at me by tacitly asking to be solved. I began and It took little time to understand the problem to be solved and here it is.

Problem to be Solved

  • User is expected to, match the pattern displayed at the right top corner of the doodle.
  • To match patterns it is required to shift bits, either 0 or 1 which can be set explicitly.
  • Each time the bits are set , doodle starts matching the modified pattern with the target pattern.
  • And if the match is successful, each letter of the word "GOOGLE" is decoded, i.e each character's color changes from gray scale to colored.
  • Once all the characters of the world "Google" is decoded, Google redirects you to page displaying search results for Alan Turning

Approach

This is more of a permutation problem combined with need to set or unset the bits appropriately.

each time a character is decoded, the level and hence the complexity of the problem increases.

Decoding Patters for each character

G = 01011
O = 00011
O = 00011
G = 01011
L = 01001
E = 10000

And Here is how I did It

Though I could capture most, but few screenshots are missed.

Decoding G

Decoding O

Decoding O

Decoding G

Decoding L

Decoding E

Google

It took a little time for me to solve, but it was worth of it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Vijay Rajanna
Engineer
India India
I am Vijay hailing from Bangalore, the silicon valley of India. I posses extensive expertise working in mobility domain. I have a natural propensity for "Research and Innovation".
 
My areas of interest include Pervasive computing, Cognitive sensors, HCI, and Multimedia. Being strongly resolute with an everlasting fervor for learning, over the years I have learnt to come out of comfort zone to experiment with state of the art technologies and to contribute to developer community.
 
I blog about innovations and latest technologies from mobility domain, about development environments and programming languages across different platforms.
 
Blog : Amusement of a speculative mind...[^]
Projects : Amusement of a dilettante mind...[^]
LinkedIn : Vijay D R [^]
Follow on   Twitter   Google+

Comments and Discussions

 
QuestionThere are 12 levels PinmemberMember 855121626-Jun-12 1:55 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.

| Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.1411023.1 | Last Updated 25 Jun 2012
Article Copyright 2012 by Vijay Rajanna
Everything else Copyright © CodeProject, 1999-2014
Layout: fixed | fluid