There is a 99% chance I am higher iq than you

[*************************]

Jfl at all you iq peasants

 

[BigDihDiddy]

Blud made his buzz feed iq result his whole personality

 

[Tumor]

Proof?

 

[Deleted Member 70402]

Aight pleb

 

[chillgirl]

Ok

 

[*************************]

Proof?

Give me a puzzle

 

[chillgirl]

Give me a puzzle

wait I’m curious at this point, what’s your iq score ?

 

[*************************]

wait I’m curious at this point, what’s your iq score ?

Idk I've never been tested, but I would say like 130 based on educational and career attainment

 

[chillgirl]

Idk I've never been tested, but I would say like 130 based on educational and career attainment

lol I scored about the same, but years ago, I think I was about 14 , I’d say it’s above average but nothing crazy (I’m not shaming you or anything pal, of course)

 

[*************************]

lol I scored about the same, but years ago, I think I was about 14 , I’d say it’s above average but nothing crazy (I’m not shaming you or anything pal, of course)

You were professionally tested?

It's 98th percentile and I imagine the average on this site skews towards the lower side.

Besides, iq is a pseudoscoentific swindle. Jfl at iqtards

 

[Nenestar]

Give me a puzzle

You're helping a robot escape from a 100x100 floor grid.
Each row except the first and the last hides exactly one laser trap, placed somewhere along the row.
No two traps share the same column, so every column contains at most one trap.
The robot starts at any cell in the top row and wants to reach any cell in the bottom row.
It can move up, down, left, or right, one cell at a time.
If it ever steps on a trap, the run instantly ends. The robot is reset back to the top row, but it remembers every trap it has found so far.

Question:
No matter how the traps are placed, what is the minimum number of attempts the robot needs to guarantee it can reach the bottom row safely? Explain the method

(Traps don’t move. Robot uses memory from previous failed attempts.)

 

[chillgirl]

You were professionally tested?

It's 98th percentile and I imagine the average on this site skews towards the lower side.

Besides, iq is a pseudoscoentific swindle. Jfl at iqtards

yes, by my psychologist, and Idk , I think that being woke enough to discover the blackpill (by yourself, not on tiktok or such) is a sign of at least being averagely smart (I think?)

 

[*************************]

You're helping a robot escape from a 100x100 floor grid.
Each row except the first and the last hides exactly one laser trap, placed somewhere along the row.
No two traps share the same column, so every column contains at most one trap.
The robot starts at any cell in the top row and wants to reach any cell in the bottom row.
It can move up, down, left, or right, one cell at a time.
If it ever steps on a trap, the run instantly ends. The robot is reset back to the top row, but it remembers every trap it has found so far.

Question:
No matter how the traps are placed, what is the minimum number of attempts the robot needs to guarantee it can reach the bottom row safely? Explain the method

(Traps don’t move. Robot uses memory from previous failed attempts.)

My initial thoughts:

First row (with trap) 1/100 chance
Second row 1/99 chance
Third row 1/98 chance
....
97th row 1/4 chance
98th row 1/3 chance

So if the robot is as unlucky as possible = 3+4+...+100= 5047 attempts to guarantee

Is that along the right lines or am I way off?

 

[*************************]

Oh wait would actually be 2+...+99=5039

Because last chance at each row is the correct one so not an attempt

 

[Nenestar]

My initial thoughts:

First row (with trap) 1/100 chance
Second row 1/99 chance
Third row 1/98 chance
....
97th row 1/4 chance
98th row 1/3 chance

So if the robot is as unlucky as possible = 3+4+...+100= 5047 attempts to guarantee

Is that along the right lines or am I way off?

Way off, it has a elegant solution.

No advanced math or algorithms needed

 

[cindythetvisleaking]

Blud made his buzz feed iq result his whole personality

Ikr if he is older than 13 he must commit suicide or something

 

[*************************]

Way off, it has a elegant solution.

No advanced math or algorithms needed

What is wrong with the logic of 5039 being an upper bound? Is there something I'm not taking into account

 

[*************************]

yes, by my psychologist, and Idk , I think that being woke enough to discover the blackpill (by yourself, not on tiktok or such) is a sign of at least being averagely smart (I think?)

I would say the opposite, you have to be low IQ to be gullible enough to get pulled into the BP sphere of the internet and sincerely believe it

 

[Nenestar]

What is wrong with the logic of 5039 being an upper bound? Is there something I'm not taking into account

Remember there's only 1 trap per row.
except the first and last rows.

and only at most 1 trap per column.


That's wa too many attempts. You could just ran down every column and find the trap there. And in 98(worst case) attempts, you know every trap. So 99 would be a more better upper bound. For brute method

 

[*************************]

Remember there's only 1 trap per row.

and only 1 trap per column.

except the first and last rows.

That's wa too many attempts. You could just ran down every column and find the trap there. And in 100 attempts, you know every trap. So 100 would be a more better upper bound. For brute method

good point

 

[Nenestar]

good point

oh fk, I gave it in a bit wrong format, it's 100 rows, 99 columns

so 98 traps.

It's the same logic, though. This framing just makes it in the hardest form(in my earlier there would be 2 open files, with no traps).

This is a hard problem, though. If you get this, you're plenty smart(In some time limit).

 

[lmrz.]

Jfl at all you iq peasants

it's not 'I am higher iq than you', it's 'i have a higher iq than you'

 

[Altruist]

it's not 'I am higher iq than you', it's 'i have a higher iq than you'

 

[*************************]

oh fk, I gave it in a bit wrong format, it's 100 rows, 99 columns

so 98 traps.

It's the same logic, though. This framing just makes it in the hardest form(in my earlier there would be 2 open files, with no traps).

This is a hard problem, though. If you get this, you're plenty smart(In some time limit).

I like it - it's a good puzzle. There must be a strategy that is better than hitting every trap (upper bound of 99) or it would be a stupid problem. but in all the scenario I can think of you could get giga unlucky with traps spammed in the diagonal, preventing you from using previous information.

 

[Nenestar]

I like it - it's a good puzzle. There must be a strategy that is better than hitting every trap (upper bound of 99) or it would be a stupid problem. but in all the scenario I can think of you could get giga unlucky with traps spammed in the diagonal, preventing you from using previous information.

The diagonal is the key of this problem. When you get it's kinda cool, and you can use solution on any n x (n-1) grid(with same logic of setting the traps), that's the crux of this problem

 

[*************************]

The diagonal is the key of this problem. When you get it's kinda cool, and you can use solution on any n x (n-1) grid(with same logic of setting the traps), that's the crux of this problem

is it ceiling of (n-1)/2 +1? so 51 for the 100x99

my very hand wavy reasoning is that the longest diagonal will always be n-1 squares long and when we have over half of the traps on the longest diagonal discovered we can always win next attempt. so we have the [ceiling of ((n-1)/2)] and then +1 for the winning attempt

(and having traps along the longest duagonal is the unluckiest you can be)

 

[Nenestar]

is it ceiling of (n-1)/2 +1? so 51 for the 100x99

my very hand wavy reasoning is that the longest diagonal will always be n-1 squares long and when we have over half of the traps on the longest diagonal discovered we can always win next attempt. so we have the [ceiling of ((n-1)/2)] and then +1 for the winning attempt

(and having traps along the longest duagonal is the unluckiest you can be)

Not that.

I can give you the solution if, you want.

 

[*************************]

Not that.

I can give you the solution if, you want.

what is the solution?

 

[fool]

You're helping a robot escape from a 100x100 floor grid.
Each row except the first and the last hides exactly one laser trap, placed somewhere along the row.
No two traps share the same column, so every column contains at most one trap.
The robot starts at any cell in the top row and wants to reach any cell in the bottom row.
It can move up, down, left, or right, one cell at a time.
If it ever steps on a trap, the run instantly ends. The robot is reset back to the top row, but it remembers every trap it has found so far.

Question:
No matter how the traps are placed, what is the minimum number of attempts the robot needs to guarantee it can reach the bottom row safely? Explain the method

(Traps don’t move. Robot uses memory from previous failed attempts.)

just two attempts no?

 

[Nenestar]

what is the solution?

I did you a bit dirty, ngl

This is a IMO problem, one of the only I have solved myself(I reworded it though). They're adding usually 1 troll question a year, to IMOs nowadays, which is fun.

But, yeah. You essentially sweep the 2nd floor where the bomb is, if it's in the middle, it's trivial, you can get behind it on 3 attempts. And the problem is, when the bomb is in the corner, then you need to figure out this staircase ascend, where you assume for the worst pattern, and you can solve it on 3.

I'll link a 5min video, that's shows it quite nicely. It's obvious when you see it visualized, kinda cool, ig

 

[Nenestar]

just two attempts no?

3, sir

 

[fool]

3, sir

first one he blows up guaranteed and second one he makes it?.

 

[Nenestar]

first one he blows up guaranteed and second one he makes it?.

the traps stay, maybe I worded it bad. There's a vid up if you wanna see the solution

 

[*************************]

I did you a bit dirty, ngl

This is a IMO problem, one of the only I have solved myself(I reworded it though). They're adding usually 1 troll question a year, to IMOs nowadays, which is fun.

But, yeah. You essentially sweep the 2nd floor where the bomb is, if it's in the middle, it's trivial, you can get behind it on 3 attempts. And the problem is, when the bomb is in the corner, then you need to figure out this staircase ascend, where you assume for the worst pattern, and you can solve it on 3.

I'll link a 5min video, that's shows it quite nicely. It's obvious when you see it visualized, kinda cool, ig

oh wow visualisations make this a lot clearer

 

[fool]

the traps stay, maybe I worded it bad. There's a vid up if you wanna see the solution

ohhhhhhh makes sense then yeah