So, what are your solutions to chestnuts?

In the worst case, I need to ask exactly 4n-8 questions .

My solution asks not more than 8(n-1) questions.

For Solutions PN me

greetz

My worst case is 5N - 10 questions

Well my worst case is 6n-15 (but it's quite elegant).
To build up a copy of the whole Cat graph do this (asking always includes building an edge if the answer was yes):

Repeat 3 times:
- Find a chestnut that has no edges yet.
- Ask n-1 (or less, never ask the same question twice) questions to find out how many other chestnuts its connected to.
- If this number is one, do the same for it's parent.

Now you've got a copy of the whole graph and classifying the chestnuts is really easy (only chestnut of degree 2 is the neck, which is connected to head, degree 1 and the chest,..).

@richie & other admins:
What's the official solution?

I bet it's not better than 4n-8

I can't wait to see the official solution tomorrow.