January 27, 2004

And to think today would have been productive (Flash)
posted by Gyan 20 years ago
  • I start first, he gets me. He starts first, he gets me. What can I do?! And the laughing - I hate the laughing! That's the pure evil of the game - not just being outwitted by a computer, but being taunted at the same time. Damn you, earring man!
  • WOO! I got it! I got it! It took me two hours, but I beat him. Take that, you punk-a** bee-yo%#@! Yeah, you better walk away. Sorry.. I'm really hungry and tired. Go here if you want to cheat and read the answer.
  • Time for Geekspeak (as if it's ever different) This is an implementation of the game of Nim. And this is how you solve it. Count the number of pearls in each row and represent them as binary (base 2) In this version, you have 3,4,5,6 pearls in rows 1,2,3,4 Written as binary in tabular form, that's 011 3 100 4 101 5 110 6 Now, count the number of 1s in each column. Col 1 - 3 Col 2 - 2 Col 3 - 2 Decide for oneself to have first move. Remove pearls such that an even number of 1s (0 or 2) remain in an column When,only one column has two or greater 1s, work to keep an odder number of 1s there (1,3). Although, once you reach this stage, just play as you would normally.