Jul 21, 2015
#49 Witch Hunt on a Tetrahedron
Three assassins are positioned on the edges of a regular tetrahedron.
The assassins are trying to find a witch, who is also on an edge of the tetrahedron.
They may all move along these edges, including through vertices to transfer from one edge to another.
The assassins know each other's locations, but not the witch's.
The witch knows the assassins' locations all times (and where they are about to move), but can only move P% as fast as them herself (0<P<100).
Is there a strategy that guarantees the assassins will find the witch in finite time? Does it depend on P?