ATRIUMsearch → argument graph
MechanismVideo · 14:53 — 17:25

The output to the puzzle is found by converting the list of moves into a map/replace operation, iterating over the input string and mapping each character to its deciphered letter.

The team writes code that iterates over the recovered string, replacing each character using their assembled cipher map, which decodes to 'Type the name of my worst enemy followed by the number 221.' ✦ AI generated

Scott · Syntax · 2026-08-03 · original ↗

starts at this moment · 14:53

We have a string separated by spaces. We basically just need to iterate over the string... We'll say the message is split. And then for each character, we'll map it. I guess I could just do a map instead of a for each where we say map at char and then we join that whole thing together. Um, and I'll also add a space in here which just maps to a space. I think I got it for first try. Here we go.

verbatim transcript · starts at 14:53

Transcript · around this moment

14:44lines. The butterflies clearly match the colors. So, the colors are clearly a clue. The butterflies are connected to the colors which are connected to the shapes. So, simply you got it. What was it? >> What? What was the order? >> I got it. >> Yeah. What was the order? >> I had actually just done it in that same blue uh or brown, blue, black, whatever order. I just pushed them quicker. I

15:14don't know if that did it or not. >> Does Claude have mouse access? Was Claude the one that did that? >> No, I think SC Scott, did you do it? >> Okay. >> Yeah, I was pushing the butterflies in the initial order that we were trying to >> Scott did it. >> Claude did not do anything. Good job, Scott. I just let I just let Claude know

15:31we got the chimney open though. Let's see what he says. >> Okay. >> Okay. Now we have a typewriter. This is perfect. We already have the cipher. Um so the typewriter has uh input code and then the message is going to write. We basically need to take that input and map each letter to the map that we created. Um >> easy. >> Yeah. Easy easy. So we have a string

15:53separated by spaces. We basically just need to iterate over the string. I'll write the code in in mind since that's where the map is. Um, but we'll have the output starts off as the empty string and then a for loop to iterate over each character. I guess I'm going to use a a for each. So, we'll say the message is split. And then for each character, we'll map it. I guess I could just do a

16:23map instead of a for each where we say map at char and then we join that whole thing together. Um, and I'll also add a space in here which just maps to a space. I think I got it for first try. Here we go. >> So, it's outputting something. >> Type the name of my worst enemy followed by the number 221. Okay, so we we decoded that which

16:54>> the worst enemy is mort. >> Okay, >> so return. So the name it morrt. >> All right, where's that at? How do I spell that? Do you want to type it in or letter by letter? >> I will type it in. >> Followed by the what number? Sorry, accidentally >> 21. >> I don't think it was just uh 21 though cuz that doesn't work. Type the name I

17:16followed by the the number >> 221 221. >> This is it. >> Yes. The map has opened. >> The map has opened. >> Okay. Amazing. We're getting somewhere now. This >> Okay. >> Uh has a string containing the location as output. So, we need to output where he is. If we go back, is there anything else we can unlock? Like we have >> Well, it's definitely No, it's

17:43definitely time to use the underground map. Um, in terms of Well, sorry, not the underground map, the thing that popped out on the chessboard. >> Oh, okay. >> So, 2 4 3 2 or whatever. >> So, he's Okay. Oh, here's that's exactly the order. He starts in Hibberry, goes two stops to Morgate. Is that Is that Does that make sense on the map? >> Hibberry. Two stops to Morgate. One,

Around this claim