Question 25
An plays the maze game shown. To win, An must enter at A and leave at B. Reaching a dead end, such as C, means losing that attempt and returning to A. At least how many attempts are needed to be sure of winning?
Assumption for this question: An does not know the correct route in advance, never repeats a dead end, and may encounter every dead end before finding B. Count the attempts needed in this worst case.
Assumption for this question: An does not know the correct route in advance, never repeats a dead end, and may encounter every dead end before finding B. Count the attempts needed in this worst case.