Play the game
inside your mind.

First Signal

Start at S. Reach G with arrow keys or the D-pad; the walls form a graph.

S = start · G = goal · # = wall · . = open path

S...#
.##..
...#.
##...
....G

Alternate Route

A blocked direct path is not a dead end. Search for another route.

S = start · G = goal · # = wall · . = open path

S.#..
..#..
#....
.###.
....G

Deep Network

Avoid local dead ends; a route is a sequence of connected states.

S = start · G = goal · # = wall · . = open path

S..#.
.#...
...#.
##...
....G

AND Gate

Two switches must BOTH be on. A = ON, B = OFF. Is the door open?

1. Yes, either switch is enough
2. No, both are required
3. Only if a timer runs

Truth Filter

A scanner accepts a code if it is red OR triangular. A blue triangle arrives. Accepted?

1. Yes, it is triangular
2. No, it is not red
3. Only if it is also large

Inference Engine

All robots in Lab A have a battery. Unit X is a robot in Lab A. What is certain?

1. Unit X can fly
2. Unit X has a battery
3. Unit X is the fastest

Signal Three

Remember order, not just which colors light up.

Observe these signals, then close your eyes and repeat them:

Signal Four

Group the flashes into a story or rhythm to recall them.

Observe these signals, then close your eyes and repeat them:

Signal Five

Chunk longer sequences into smaller patterns.

Observe these signals, then close your eyes and repeat them:

Power Restore

Tapping a node flips itself and its vertical/horizontal neighbors.

Imagine a 3 × 3 lamp grid numbered left-to-right, top-to-bottom:

1 2 3
4 5 6
7 8 9

Every tap flips the selected lamp and its orthogonal neighbors. The puzzle starts with these node toggles applied: 1, 5.

Cross Current

One action changes five related states. Predict side effects.

Imagine a 3 × 3 lamp grid numbered left-to-right, top-to-bottom:

1 2 3
4 5 6
7 8 9

Every tap flips the selected lamp and its orthogonal neighbors. The puzzle starts with these node toggles applied: 2, 6, 9.

Blackout Protocol

Use symmetry and reversibility: two identical flips cancel out.

Imagine a 3 × 3 lamp grid numbered left-to-right, top-to-bottom:

1 2 3
4 5 6
7 8 9

Every tap flips the selected lamp and its orthogonal neighbors. The puzzle starts with these node toggles applied: 1, 3, 5, 7.

Balanced Supply

You need 7 units, and can choose at most two sources.

Power units: 2, 3, 5. Meet exactly 7 units using at most 2 generators.

Efficient Load

The cheapest solution is not always the smallest single part.

Power units: 3, 4, 6. Meet exactly 10 units using at most 2 generators.

Precision Power

Find the pair that satisfies the total demand, no more and no less.

Power units: 4, 6, 7. Meet exactly 11 units using at most 2 generators.

Off-By-One

What correction prevents reading a missing fourth item?

1. Change i <= 3 to i < 3
2. Change i++ to i--
3. Remove the loop completely

for (let i = 0; i <= 3; i++) {
  print(items[i]); // 3 items
}

The Endless Loop

How do you ensure the loop eventually ends?

1. Set energy to 10 first
2. Decrease energy inside the loop
3. Add a second fireLaser call

let energy = 3;
while (energy > 0) {
  fireLaser();
}

The Wrong Comparison

How should JavaScript compare the value instead of assigning it?

1. Use score + 100
2. Use score != 100
3. Use score === 100

if (score = 100) {
  unlockGate();
}

The Last Corridor

The solution exists; trace connectivity across the bottleneck.

S = start · G = goal · # = wall · . = open path

S...#
###..
.....
.###.
....G

The Master Rule

The exit opens only if the route is cleared AND at least one generator is online. Route = clear. Generators = offline. Open?

1. Yes, route clearance is enough
2. No, the generator condition is false
3. Yes, if you wait

Core Convergence

Repair the circuit, then balance its power. Your entire training comes together.

Phase 1: Repair the 3×3 light circuit. Phase 2: power the reactor with two generators totaling 12.