Tod | Rla Walkthrough

Solution: – instructions that produce the same result if repeated or skipped.

In essence, TOD-RLA is a where you must manipulate a set of registers through a sequence of conditional jumps, arithmetic operations, and memory swaps. The "Destiny" part comes from a pseudo-random number generator (PRNG) that determines which instruction executes next. tod rla walkthrough

So we must fill 12 cycles with operations that keep R0 = R3 at the cycle, despite random swaps or skips. Step 2.3 – Handling Destiny Swaps Destiny swaps exchange R2 and R3 every 4 cycles (if the random square condition is met). That means R3 might unexpectedly change. Solution: – instructions that produce the same result

Also note: R4 = 1 and R5 = 1 . Those might be loop counters. Without randomness, the solution is trivial: So we must fill 12 cycles with operations

Strategy: – store a backup of the target value elsewhere.

0x20: ADD R0, R0 ; R0 = 10 (5+5) 0x21: HLT But that takes 2 cycles. Destiny event at cycle 4 (which never occurs if we halt early). However, the problem says 12 cycles allowed , not required. But wait – the puzzle's twist: . The environment expects exactly 12 cycles to elapse, and a validation routine runs at the end. If you halt early, it fails.

Thus, we need exactly 12 instructions. Here’s the verified working solution for seed 42 (most common default):