Two FBI agents arrive at a dangerous junkyard, at position K. As a shootout ensues, they receive a local map on their
cell phones. The circles represent regions of safety. If one agent stays on a colored circle, and covers for their
partner, then the partner may safely run along paths of that color. In order to defeat the gang, both agents must arrive
safely at circle I. For example, KK (start with two agents on K) - KP (agent on yellow K covers for partner's run on
yellow path) - AP (agent on yellow P covers for partner's run on yellow path) - AF (agent on red A covers for partner's
run on red path) - AA (agent on red A covers for partner's run on red path) - AB. But this seems to be a dead end.
Can you guide the two agents to I, safely?
Puzzles provided by Wolfram Research, Makers of Mathematica