An ant wishes to make a circuit on the board shown, visiting each square exactly once and returning to the starting square. At each step the ant moves to an adjacent square across an edge. Two circuits are considered to be the same if the first follows the same path as the second but either starts at a different square or follows the same path in reverse. How many circuits are possible?
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 Mathematical Olympiad 2009 (2009)
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 Mathematical Olympiad 2009 (2009)