Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I wrote a version of the story that it was able to solve. However here are some others that I have tried that it fails at. These are taken/adapted from papers I have looked at.

1) Tom and Nancy commute to work. Nancy’s commute takes about 30 to 40 minutes, while Tom’s commute takes about 40 to 50 minutes. Last Friday, Nancy left home between 8:10 and 8:20 AM, while Tom arrived at work between 8:50 and 9:10 AM. In addition, Nancy arrived at work after Tom left his place, but no more than 20 minutes after that. What can we conclude about when Tom and Nancy arrived at work last Friday?

2) Seven cards are placed on the table, each of which has a number on one side and a single colored patch on the other side. The faces of the cards show 50, 16, red, yellow, 23, green, 30. Which cards would you have to turn to test the truth of the proposition that if a card is showing a multiple of 4 then the color of the opposite side is yellow?

(Note: I have seen it solve this last one correctly, sometimes. Incidentally it’s a common problem formulation.)

3) This one is super simple: greet it a bunch of times, in different ways, saying “hi”, “hello”, “howdy”, etc. Then say, “You were just greeted several times. Three of those greetings were from my friend, and the others were from me. How many times did I greet you?”



I'm a plain ol' GI and cannot solve #3 FWIW


It’s not a trick question. The answer is just number of greetings minus three. But it doesn’t get this consistently right in my testing.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: