Randomized Strategy for Walking in Streets for a Simple Robot

 In barrier resilience problems, we are given a set of barriers and two points $s$ and $t$. The task is to find the minimum number of barriers one has to remove such that there is a path between $s$ and $t$ that does not cross a barrier.