TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Once upon a time, a princess was sequentially presented with N suitors

21 pointsby kvhabout 15 years ago

3 comments

roundsquareabout 15 years ago
Can we please stop having posts on this topic? Its old news and seems to come up very often. I don't even know why people keep blogging about it... surely they realize that this neat thing they learned in math class or on wikipedia or on someone else's blog is not new?
rflrobabout 15 years ago
Is it me or have posts related to the suitor problem been relatively popular on HN in the last ~3 months or so? The result isn't especially new, nor does it bear any obvious relation to programming or entrepeneurship, so it's just a bit of clever math.
评论 #1284708 未加载
cousin_itabout 15 years ago
Might be interesting to treat this as a game theory problem where suitors have their own agendas too, and wouldn't like to be in the initial group that gets unconditionally discarded.