The diagram shows part of a river which has two islands in it. There are six bridges linking the islands and the two banks as shown. Leonhard goes for a walk every day in which he walks over each bridge exactly once. He always starts at point , goes first over bridge 1 and always finishes at point .
What is the maximum number of days that he can walk without repeating the order in which he crosses the bridges?
Select one option, then click Submit.
2
4
5
6
\text{More than 6}
Select an option, then submit.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
Junior Kangaroo 2016 (2016)
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →Junior Kangaroo 2016 (2016)