Given a maze based on a square grid with an entrance at A and two exits at B and C, is there a navigational strategy that guarantees a 50% probability of exiting the maze at B and a 50% probability of exiting the maze at C, regardless of the shape of the maze? According to the recent paper Exploring mazes at random by Nikita Gladkov and Igor Pak, the an…
Keep reading with a 7-day free trial
Subscribe to A Piece of the Pi: mathematics explained to keep reading this post and get 7 days of free access to the full post archives.