Join 58,000+ Looksmaxxing Members!

Register a FREE account today to become a member. Once signed in, you'll be able to participate on this site by adding your own topics and posts, as well as connect with other members through your own private inbox.

  • DISCLAIMER: DO NOT ATTEMPT TREATMENT WITHOUT LICENCED MEDICAL CONSULTATION AND SUPERVISION

    This is a public discussion forum. The owners, staff, and users of this website ARE NOT engaged in rendering professional services to the individual reader. DO NOT use the content of this website as an alternative to personal examination and advice from licenced healthcare providers. DO NOT begin, delay, or discontinue treatments and/or exercises without licenced medical supervision. Learn more

im the highest IQ user currently online AMA

Register to hide this ad
the question only asked for one answer, you're being a nerd (and not the high iq kind)
true, I agree i'm a lil drunk:

Can you solve this problem, saar?

Jack plays a game on a matrix with 100 rows and 99 columns (100x99).
There is exactly one trap on each row, but not on rows 1 or 100.
And there can be only max one trap per column.

Then Jack starts from the first row, and he can move left, right, up, and down one step at a time.
If Jack hits a trap, he will remember its position and the trap stays there (traps never move, and they stay active at all times). Jack will then start at row 1 again.

Problem is, what is the minimum amount of tries Jack has to do to guarantee an ascend from row 1 to row 100?
What is the strategy and the amount?
 
true, I agree i'm a lil drunk:

Can you solve this problem, saar?

Jack plays a game on a matrix with 100 rows and 99 columns (100x99).
There is exactly one trap on each row, but not on rows 1 or 100.
And there can be only max one trap per column.

Then Jack starts from the first row, and he can move left, right, up, and down one step at a time.
If Jack hits a trap, he will remember its position and the trap stays there (traps never move, and they stay active at all times). Jack will then start at row 1 again.

Problem is, what is the minimum amount of tries Jack has to do to guarantee an ascend from row 1 to row 100?
What is the strategy and the amount?
3, you asked me this before

sweep the first row then go around. if trap is at the edge then staircase and if you hit a 2nd trap go restaircase and then finish from the edge
 
3, you asked me this before

sweep the first row then go around. if trap is at the edge then staircase and if you hit a 2nd trap go restaircase and then finish from the edge
oh, you're that user
 

Users who are viewing this thread

Back
Top