• Log InLog In
  • Register
Liquid`
Team Liquid Liquipedia
EST 14:12
CET 20:12
KST 04:12
  • Home
  • Forum
  • Calendar
  • Streams
  • Liquipedia
  • Features
  • Store
  • EPT
  • TL+
  • StarCraft 2
  • Brood War
  • Smash
  • Heroes
  • Counter-Strike
  • Overwatch
  • Liquibet
  • Fantasy StarCraft
  • TLPD
  • StarCraft 2
  • Brood War
  • Blogs
Forum Sidebar
Events/Features
News
Featured News
Rongyi Cup S3 - Preview & Info3herO wins SC2 All-Star Invitational14SC2 All-Star Invitational: Tournament Preview5RSL Revival - 2025 Season Finals Preview8RSL Season 3 - Playoffs Preview0
Community News
Weekly Cups (Jan 19-25): Bunny, Trigger, MaxPax win1Weekly Cups (Jan 12-18): herO, MaxPax, Solar win0BSL Season 2025 - Full Overview and Conclusion8Weekly Cups (Jan 5-11): Clem wins big offline, Trigger upsets4$21,000 Rongyi Cup Season 3 announced (Jan 22-Feb 7)32
StarCraft 2
General
StarCraft 2 not at the Esports World Cup 2026 Oliveira Would Have Returned If EWC Continued Weekly Cups (Jan 19-25): Bunny, Trigger, MaxPax win herO wins SC2 All-Star Invitational PhD study /w SC2 - help with a survey!
Tourneys
$21,000 Rongyi Cup Season 3 announced (Jan 22-Feb 7) OSC Season 13 World Championship $70 Prize Pool Ladder Legends Academy Weekly Open! SC2 All-Star Invitational: Jan 17-18 Sparkling Tuna Cup - Weekly Open Tournament
Strategy
Simple Questions Simple Answers
Custom Maps
[A] Starcraft Sound Mod
External Content
Mutation # 510 Safety Violation Mutation # 509 Doomsday Report Mutation # 508 Violent Night Mutation # 507 Well Trained
Brood War
General
[ASL21] Potential Map Candidates BW General Discussion BGH Auto Balance -> http://bghmmr.eu/ Which foreign pros are considered the best? Gypsy to Korea
Tourneys
Small VOD Thread 2.0 [Megathread] Daily Proleagues Azhi's Colosseum - Season 2 [BSL21] Non-Korean Championship - Starts Jan 10
Strategy
Current Meta Simple Questions, Simple Answers Soma's 9 hatch build from ASL Game 2 Game Theory for Starcraft
Other Games
General Games
Mobile Legends: Bang Bang Nintendo Switch Thread Beyond All Reason Battle Aces/David Kim RTS Megathread Stormgate/Frost Giant Megathread
Dota 2
Official 'what is Dota anymore' discussion
League of Legends
Heroes of the Storm
Simple Questions, Simple Answers Heroes of the Storm 2.0
Hearthstone
Deck construction bug Heroes of StarCraft mini-set
TL Mafia
Vanilla Mini Mafia Mafia Game Mode Feedback/Ideas
Community
General
US Politics Mega-thread Russo-Ukrainian War Thread YouTube Thread Canadian Politics Mega-thread European Politico-economics QA Mega-thread
Fan Clubs
The herO Fan Club! The IdrA Fan Club
Media & Entertainment
Anime Discussion Thread [Manga] One Piece
Sports
2024 - 2026 Football Thread
World Cup 2022
Tech Support
Computer Build, Upgrade & Buying Resource Thread
TL Community
The Automated Ban List
Blogs
Understand The Significa…
leoparker22
How Esports Advertising Shap…
TrAiDoS
My 2025 Magic: The Gathering…
DARKING
Life Update and thoughts.
FuDDx
How do archons sleep?
8882
Customize Sidebar...

Website Feedback

Closed Threads



Active: 1624 users

brain teaser - Page 4

Blogs > Shady Sands
Post a Reply
Prev 1 2 3 4 All
Ota Solgryn
Profile Blog Joined January 2008
Denmark2011 Posts
November 22 2012 08:37 GMT
#61
On November 21 2012 23:25 DarkPlasmaBall wrote:
Show nested quote +
On November 21 2012 22:46 Ota Solgryn wrote:
On November 21 2012 21:47 Rannasha wrote:
On November 21 2012 19:48 Ota Solgryn wrote:
On November 21 2012 06:40 Shady Sands wrote:
Imagine you have, at most, two identical rocks and a 100-floor building.

Using only the method of dropping a rock from a certain floor and seeing whether it will crack open or not, what is the least number of drop attempts you need to use to figure out the highest floor from which a rock, dropped, will not break?

1) Breaking is ordinal--a rock that breaks from a 60 floor etc. can be safely assumed to break from a 70 floor drop, etc.

Once you have calculated this for the 100-floor building, what is the answer for an n-floor building?


The least number of drops you need to use is 2. You drop the first rock from n+1 floor -> it breaks. You drop the next rock from n floor -> it doesn't break. So now you know the highest floor from which is doesn't break is the n floor.

Except you don't know what n is.

I did it this way becuase the question is the least number of drops.
Most people here seem to calculate what is the maximum number of drops you would need to use in the case you have the most optimal way of generally finding the highest floor of which the rock would be intact.


What you answered is the least number of drops you need to verify that the highest non-breaking-floor is n, when n is provided a priori. If n is not known, you need to the "best worst-case-scenario", which is what people have been calculating.


No, I provided the least number of drops you need if you make a lucky guess, I do not need to know n, nowhere does the question state that you could not make guess, and be lucky with that guess. Anyhow, I just answered it as was it a trick question, which to me it is, because of a vague formulation.


While I understand that possible ambiguity/ need to be clever, I'm also pretty sure that based on the context, you really understood that it wasn't a trick question. It means for any given floor, the fact that you're always looking to optimize your answer (not just "get lucky"), and the understanding that you can't risk both rocks breaking without knowing for a fact what the correct floor is. You can't just arbitrarily say, "I choose to pick the two perfect floors to give me the correct answer, meaning the answer's two", because you're incapable of knowing for sure that you'd pick those two ideal floors. You'd need to already know the answers, and then drop the rocks to reconfirm them. However, as the person dropping the rocks, you don't actually know yet what those ideal floors are.

I mean, after all, if you really want to be a dick about it, why not just say, "Well I was super lucky in my individual trial because the answer was "the rock breaks at the first floor" and I dropped my first rock on the first floor and it broke, and therefore I didn't even need the second rock. Answer's one." It's really missing the point of the brain teaser, because if it hadn't broken, I would have only eliminated one floor in one step, and I'd still have ninety-nine to go... and you simply can't work under the assumption that it will be the first floor, so it's silly to pick floor one to drop the first rock. It will be better for you (probability-wise) to drop the first rock at floor two at step one than at floor one.


Yeah, you're right, I was trying to be clever ;o) but my point still stands.
The least number of drops you would need to show the highest floor from which the rock will not drop is still 2, and here I do not assume that I know the floor, I assume the specific case in which a lucky guess was made. And this specific case would yield the result of least dropped rocks: 2.

Your last paragraph I also commented on, but I excluded this as the answer becuase if the rock breaks at the first floor then there is no floor from which the rock survives a drop and the answer is not 1 but null.
ihasaKAROT: "Wish people would stop wasting their lives on finding flaws in others"
Rannasha
Profile Blog Joined August 2010
Netherlands2398 Posts
November 22 2012 09:30 GMT
#62
On November 22 2012 11:18 LockeTazeline wrote:
I think:

+ Show Spoiler +
Drop it from the midway point of the available floors, rounded up.

Longest solve (answer 1st floor):
-50 (break)
-25 (break)
-13 (break)
-7 (break)
-4 (break)
-2 (break)
-1 (break)

=7

Overall: Log 2 of n. (rounded up)


You only have 2 rocks you can break, not 7.
Such flammable little insects!
Prev 1 2 3 4 All
Please log in or register to reply.
Live Events Refresh
Next event in 5h 48m
[ Submit Event ]
Live Streams
Refresh
StarCraft 2
mouzHeroMarine 612
IndyStarCraft 246
UpATreeSC 135
Livibee 80
MindelVK 67
JuggernautJason63
ForJumy 8
StarCraft: Brood War
Calm 2457
Shuttle 681
Larva 431
Dewaltoss 207
Light 192
firebathero 131
Rush 65
NaDa 20
Dota 2
qojqva3166
Dendi942
League of Legends
C9.Mang0130
Counter-Strike
byalli2850
fl0m2143
pashabiceps1985
allub342
adren_tv75
ptr_tv63
Heroes of the Storm
Liquid`Hasu231
Khaldor119
Other Games
gofns8762
Grubby4203
FrodaN2104
Beastyqt903
ceh9512
DeMusliM319
ArmadaUGS181
Harstem171
QueenE131
ToD75
Mew2King64
Organizations
StarCraft 2
angryscii 21
Blizzard YouTube
StarCraft: Brood War
BSLTrovo
sctven
[ Show 16 non-featured ]
StarCraft 2
• Adnapsc2 9
• AfreecaTV YouTube
• intothetv
• Kozan
• IndyKCrew
• LaughNgamezSOOP
• Migwel
• sooper7s
StarCraft: Brood War
• FirePhoenix14
• 80smullet 3
• BSLYoutube
• STPLYoutube
• ZZZeroYoutube
League of Legends
• TFBlade1408
• Shiphtur568
Other Games
• imaqtpie1675
Upcoming Events
PiGosaur Cup
5h 48m
Replay Cast
13h 48m
RongYI Cup
15h 48m
herO vs Solar
TriGGeR vs Maru
WardiTV Invitational
18h 48m
The PondCast
1d 13h
HomeStory Cup
2 days
Korean StarCraft League
3 days
HomeStory Cup
3 days
Replay Cast
4 days
HomeStory Cup
4 days
[ Show More ]
Replay Cast
5 days
Replay Cast
6 days
Wardi Open
6 days
Liquipedia Results

Completed

Proleague 2026-01-26
OSC Championship Season 13
Underdog Cup #3

Ongoing

CSL 2025 WINTER (S19)
KCM Race Survival 2026 Season 1
Acropolis #4 - TS4
Rongyi Cup S3
BLAST Bounty Winter 2026
BLAST Bounty Winter Qual
eXTREMESLAND 2025
SL Budapest Major 2025
ESL Impact League Season 8
BLAST Rivals Fall 2025

Upcoming

Escore Tournament S1: W6
Escore Tournament S1: W7
Acropolis #4
IPSL Spring 2026
uThermal 2v2 2026 Main Event
Bellum Gens Elite Stara Zagora 2026
LiuLi Cup: 2025 Grand Finals
HSC XXVIII
Nations Cup 2026
PGL Bucharest 2026
Stake Ranked Episode 1
BLAST Open Spring 2026
ESL Pro League Season 23
ESL Pro League Season 23
PGL Cluj-Napoca 2026
IEM Kraków 2026
TLPD

1. ByuN
2. TY
3. Dark
4. Solar
5. Stats
6. Nerchio
7. sOs
8. soO
9. INnoVation
10. Elazer
1. Rain
2. Flash
3. EffOrt
4. Last
5. Bisu
6. Soulkey
7. Mini
8. Sharp
Sidebar Settings...

Advertising | Privacy Policy | Terms Of Use | Contact Us

Original banner artwork: Jim Warren
The contents of this webpage are copyright © 2026 TLnet. All Rights Reserved.