Path Triage

Each case has its own small directed word map. Probe the source or destination register to learn whether that word is included. Expand a discovered word to inspect all its outgoing arrows. Choose which branch to investigate.
A bridge is proved when both endpoints are registered and the destination is discovered. A missing endpoint is proved by a failed register probe. Disconnection is proved only after both endpoints are known and every reachable word has been expanded. A bare absence from a cache proves nothing.
Each case starts with 100 potential points. Every new probe costs 5. Claims without sufficient evidence use no attempt. Once evidence establishes an outcome, a wrong claim closes that case for 0. Abandon or Reveal also earns 0. The file has three cases and a 12-probe limit per case. Arrows belong to this finite authored map; they do not exhaust real-world associations.

Daily changes at 00:00 UTC. This authored collection repeats 8 daily puzzles and has 4 separate practice puzzles. The saved-progress notice shows whether this browser or the server is keeping your progress.