A new O(log N) algorithm for the egg-dropping problem | Hacker News - But Better

A new O(log N) algorithm for the egg-dropping problem arxiv.org

The generalized egg dropping problem is a classic challenge in sequential decision-making. Standard dynamic programming evaluates the minimax minimum number of tests in $\mathcal{O}(K \cdot N^2)$ time. A known approach…

4 points•tuluvit•9 days ago•0 comments•

#egg #dropping #dropping problem #egg dropping #algorithm #log #egg dropping problem #generalized

0 comments

No comments yet.

Related stories

the-algorithm: Source code for Twitter's Recommendation Algorithmgithub.com
Lobsters · 29 points · over 3 years ago
Synthesizing a Plucked String Sound With the Karplus-Strong Algorithmblog.demofox.org
Lobsters · 6 points · over 10 years ago
Pi Connects Colliding Blocks to a Quantum Search Algorithm (2020)quantamagazine.org
Hacker News · 3 points · 11 days ago
YouTube's Custom Feeds Give You More Control over the Algorithmwired.com
Hacker News · 2 points · 7 days ago
Mullet of Log Processing: Determinism in the Front, AI at the Back (Expanso/Jev)expanso.io
Hacker News · 2 points · 9 days ago
Why the hard part of route optimization is the modeling, not the algorithmkardinal.ai
Hacker News · 1 points · 9 days ago