THE_BACKROOM_REVENGE

lizzythecatto

I was just walking around, complaining about how boring the world had become, how almost anything could be solved with OSINT. Then I suddenly fell. It felt like I was phasing straight through the ground itself, no-clipping into somewhere completely unfamiliar.

Infinity is incomprehensible to the human mind. And yet, it encapsulates every aspect of ######, from the variations in its architecture to its sprawling size. It feeds into its shattering emptiness, infecting the mind with malignant delirium, which slowly consumes one to their very core. The dark echoes of liminality grip one's heart, feeding the madness.

Looping, looping, looping, looping Looping 'round again, looping 'round again Endless, endless, endless, endless Endless fractal loop, endless fractal loop

I have tried every possible way, but I just keep looping. While wandering through this place, I overheard someone say that if I could find Level #####, I might finally escape.

Please, find me a valid path.

Requirements Start at Level #### and end at Level ####. (pic 1 and 2) You may only travel through numbered levels, where 0 <= X <= 1000 Unnumbered levels are not allowed. The path must be a simple path, meaning no level may appear more than once. Find the longest simple path from Level #### to Level ####. If multiple paths share the maximum length, choose the one whose sequence of level numbers is lexicographically smallest. Flag Format LYKNCTF{}

There are exactly 3 valid flags for this challenge.

How to Build the Flag Concatenate every level number in the chosen path in traversal order. Do not include spaces, commas, arrows, hyphens, or any other separators. Example If a valid path is:

1 -> 36 -> 67 -> 128 -> 12 -> 69

Then the flag is:

LYKNCTF{136671281269}

All valid level transitions in this challenge must be inferred from the Backrooms Wiki: https://backrooms-wiki.wikidot.com/