Live data from Hacker News

Coming to Agreement, a logic puzzle for Oxford admissions interviews

jdh.hamkins.org

21–30 of 99 posts

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#21
post #19
post #17

Earlier quoted context omitted.

This is not true in a live and death scenario, because with asymmetric payoffs like that - termination being the down side risk - it is not at all „rational“ to jump to the answer that gives the highest probability of success, if that answer still has a non-zero risk of death.

Then as I mentioned below, you neither of you send a message and the game remains open indefinitely.

How do you do that after you’ve been killed for screaming „blue“?

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#22

> Some student candidates had proposed an interesting idea of trying to blend the two colors. [...] I like this idea a lot, but it seems problematic in light of the fact that we don’t have such a clear and unambiguous means of combining colors. Not if we use RGB, send the color as a tuple of three numbers and average both tuples (taking the floor for example if one of the numbers is odd).

How would you know to use RGB and not CMYK or HSL?

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#23
This is why Oxbridge admissions are a bit of a crap shoot.

What they're really after is whether you can keep thinking and not be intimidated into silence. Just about any subject that a professor understands can be taken to where a high school graduate is stumped. You can always add twists to just about anything interesting. They key is to realise they are testing whether you'll interact well, not whether you can figure out the answers.

I was quite fortunate, they kept asking me things that I knew and they weren't disappointed with where my limits were.

It does come off as a bit confrontational to the modern observer I'd say, and it does give the impression that tutorials are some sort of intellectual sparring match. They're not, clearly you'd be flattened by the professor if they were.

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#24

> Some student candidates had proposed an interesting idea of trying to blend the two colors. [...] I like this idea a lot, but it seems problematic in light of the fact that we don’t have such a clear and unambiguous means of combining colors. Not if we use RGB, send the color as a tuple of three numbers and average both tuples (taking the floor for example if one of the numbers is odd).

How would you know to use RGB and not CMYK or HSL?

Does it matter? I mean when we announce the color we will announce it in all of them since it's the same color.

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#25

One of the difficulties is deciding on a strategy that would work even if the other player used the exact same strategy on you. My solution is to say something like: ‘I will nominate a colour next round. If we both nominate the same colour, I will say that colour and end the game next round. If anything else, I will nominate a different colour, proceeding alphabetically.’ Of course, it would depend on what message yo…

If you can rely on the other player being logical (as suggested), just wait for them to suggest a colour then use it. If they do not suggest a colour (perhaps they are waiting for you to suggest?) then suggest a colour yourself, then the other player being as logical as you will use it.

Job done.

These scenarios in TFA seem to imply that both players want to be the "leader" as it were (all this talk of breaking symmetry etc) and that this is so somehow some sort of interminable problem. The problem does not seem to state any "cost" of waiting a turn, so there is no rush it seems, and there seems to be no cost of being the "leader" or "follower".

This is a basic master-election issue more than anything. Solved problem ... see paxos et al (although I concede that this is more of a "how you think" question, and less about the "correct answer")

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#26

One of the difficulties is deciding on a strategy that would work even if the other player used the exact same strategy on you. My solution is to say something like: ‘I will nominate a colour next round. If we both nominate the same colour, I will say that colour and end the game next round. If anything else, I will nominate a different colour, proceeding alphabetically.’ Of course, it would depend on what message yo…

That's not a difficulty. As noted in the post, you can easily solve it through the application of randomness. All you need is for one player to send an unopposed message announcing a color; at that point both players can use that color. There are only two failure states you can be in: both players can be talking, or both players can be waiting for a message. In the first case, one player needs to shut up long enough for the other player to make a choice. In the second case, one player needs to make a choice. A random approach will let these tiebreakers occur in an asymmetric way.

> So maybe you’d have a clause which says, if the other player gives an ultimatum message, then you will go along with that.

But that doesn't work, because both players can send such a message simultaneously, but they can't both comply simultaneously.

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#27

One of the difficulties is deciding on a strategy that would work even if the other player used the exact same strategy on you. My solution is to say something like: ‘I will nominate a colour next round. If we both nominate the same colour, I will say that colour and end the game next round. If anything else, I will nominate a different colour, proceeding alphabetically.’ Of course, it would depend on what message yo…

If you can rely on the other player being logical (as suggested), just wait for them to suggest a colour then use it. If they do not suggest a colour (perhaps they are waiting for you to suggest?) then suggest a colour yourself, then the other player being as logical as you will use it. Job done. These scenarios in TFA seem to imply that both players want to be the "leader" as it were (all this talk of breaking symme…

Waiting has just as much of a symmetry problem as leading does.

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#28
post #21
post #19

Earlier quoted context omitted.

Then as I mentioned below, you neither of you send a message and the game remains open indefinitely.

How do you do that after you’ve been killed for screaming „blue“?

But I'm only killed if they don't say blue and end the game on that - if they stay silent the game runs forever.

So still think it makes sense to say it. It might get through and they repeat and we win. It might not, and they'd be taking a guess that I'd said it. (but the alternate would be I've not sent a message, providing best output of game-running forever/death - so if they presumed I was logical, they'd know I'd said 'blue')

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#29
post #21
post #19

Earlier quoted context omitted.

Then as I mentioned below, you neither of you send a message and the game remains open indefinitely.

How do you do that after you’ve been killed for screaming „blue“?

You don't seem to have read all of goldcd's original comment:

>>> and the two of you would just scream "blue" at each other

You come to an agreement before you announce a choice.

Re: Coming to Agreement, a logic puzzle for Oxford admissions interviews

#30
post #7

I'm surprised more people didn't recognize the two generals problem.

FTA: We had used these puzzles in our admissions interviews of candidates for a place at Oxford University in the degree courses Math/philosophy, CS/philosophy, and PPE at University College, Oxford I’m not familiar with the term “degree course”, but suspect the candidates were bright, but also around 18 years old.

I'm guessing "degree course" means "degree".
Post reply on HN