[a / b / c / d / e / f / g / gif / h / hr / k / m / o / p / r / s / t / u / v / vg / vr / w / wg] [i / ic] [r9k / s4s / vip / qa] [cm / hm / lgbt / y] [3 / aco / adv / an / asp / bant / biz / cgl / ck / co / diy / fa / fit / gd / hc / his / int / jp / lit / mlp / mu / n / news / out / po / pol / qst / sci / soc / sp / tg / toy / trv / tv / vp / wsg / wsr / x] [Settings] [Search] [Home]
Board
Settings Home
/sci/ - Science & Math



Thread archived.
You cannot reply anymore.




File: platformsz.png (677 KB, 1000x1024)
677 KB
677 KB PNG
After some research on the mathematical capabilities of NPCs, I've figured out a special problem (translated into a puzzle) that is unsolvable to them without any assistance.
Among the people I've sent this to that couldn't figure it out, none of them had internal monologues, synesthesia of any type, or the "imaginary radio station" phenomenon.
It's really uncanny to speak to people like this (especially in person) when there's a high chance that they're really just a vacant p-zombie.
>>
RLLRLRLLRRL/LRRLRLRRLLR
>>
>>10001781
The universe is a single player game
>>
LRRLRLLRRLL
LRRLRLLRRLR
RLLRLRRLLRR
RLLRLRRLLRL
>>
Surely the devil will just pick 1 and make you dead no matter what, unless you go LLRRLLRRLLR?
>>
can the devil stop individual odd moves or can he only make odd moves either follow or not follow?
>>
>Without loss of generality you can choose the 8th instruction to be R.
???????R???
>Then the 4th has to be L as the devil can choose N=4.
???L???R???
>Then if you consider N=2 you have
?L?R?
>The only valid way to fill it the first two open slots is with
RLLR?
>So at this point the whole sequence is
?R?L?L?R???
>Between the two L's there has to be an R and the 1st has to be an L so
LR?LRL?R???
>Consider N=5 to see the 10th has to be L.
LR?LRL?R?L?
>By looking at N=3 you see that the 3th must be R.
LRRLRL?R?L?
>Now you can see that the 8th must be an L and the 10th must be an R.
LRRLRLLRRL?
>The last instruction can be whatever you want.
>>
My first idea is just to write 11 nested loops and bruteforce this, since there are only 2^11 possible sequences but I'm too lazy.
>>
>>10002077
I did basically this to get
RLLRLRRLLRL

Every 2nd instruction
LRRLR

Every 3rd
LRL

Every 4th
RL

Every 5th
LR

Then the rest are just single instructions so can't kill ya
>>
>>10001781
idk
>>
>>10001902
This
>>
>>10001902
This is the solution.
>>
what if n=1
>>
I'm confused. The instructions say 'You can jump left, but doing so again will kill you,'

It says nothing about where you're standing at the time. Jump left twice, any time during the exercise and you die. The people who make these puzzles need to do better in their language. They also spell middle wrong but whatever.
>>
>>10001781
I dont listen to the devil and just sit there until the devil runs out of patience.
>>
>>10001781
LLRRLLRRLLR
OR
>>10002307
>>
>>10001781
Bump because I just broke the problem and I'm preparing a detailed multi-post solution, so I don't want this thread to be archived.
>>
>>10001781
impossible to solve for every possible value N.

OP is an NPC
>>
>>10002386

oh wow... nvm
>>
>>10001828
t. solipsist
>>
>>10002386
It doesn't have a solution for any N>=12. I have proven it. Give me a few hours, I will post a homemade paper about this problem...
>>
>>10001902
n=11
you die in example 1 and 3
>>
I have finished my work on this problem. I will be uploading it now. Sorry for the delay, my upload speed is 50kBps
>>
>>10002610
>>
>>10001781
RLLRLRRLLR_
The last one doesn't matter and this pattern would work if R and L are switched.
>>
>>10002612
I hate my fucking connection
>>
>>10002628
>>
>>10001781
>You can choose every instruction
The problem doesn't state you need to make the series of instructions all at once. So I guess you can just choose instructions one by
one and when you get blocked by the devil you adapt accordingly.
>>
>>10001781

N=0
>>
>>10002077

The negation of your sequence works as well.
>>
>>10002628
Continuation - I found a new connection in a local bar
>>
>>10002628
Pls someone read my shit I spent 3 hours writing this shit
>>
File: scoop.jpg (37 KB, 501x440)
37 KB
37 KB JPG
>>10001781
The what-ever-the-fuck-its-named-pattern:
011010011001011010...
For any place in the sequence you convert the number to binary and XOR all the bits of that number. Invert it if you're female. It's a fractal so any sequence that's every (2N)th thing, creates either same exact pattern or its inverse.
>>
>>10002304
Shut the fuck up faggot retard
>>
>>10002851
I really appreciate the effort anon, thank you. I will save and post these images every time this OP appears again, just for you.
>>
File: 1482520136080.gif (1.69 MB, 423x234)
1.69 MB
1.69 MB GIF
>>10001781
>>
i dont do anything

only npcs have to follow inputs
>>
>>10002851
The reason no one is responding is that everyone already knows the story behind this problem
https://en.wikipedia.org/wiki/Sign_sequence
https://youtu.be/pFHsrCNtJu4
>>
>>10001781
Nice try
https://www.wired.com/2015/10/a-magical-answer-to-an-80-year-old-puzzle/
>>
>>10001781
You would have to exclude n=1 for there to be a solution for any value of n wouldn't you?
>>
>>10003117
nope
>>
>>10002395
n=11 is just the 11th command not 1 and 11
>>
>>10003110

Thank you. The entropy approach is amazing.
>>
sounds like some of the faggy interview questions I've had as a dev
lol nibba I write software I don't solve stupid riddles made up by faggots
worst. career. evar.
>>
https://youtu.be/pFHsrCNtJu4

LOL





Delete Post: [File Only] Style:
[Disable Mobile View / Use Desktop Site]

[Enable Mobile View / Use Mobile Site]

All trademarks and copyrights on this page are owned by their respective parties. Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.