The board for the game Rorrim is shown. In the game, a counter has to be moved from the starting square, S, to the target square T, in the smallest possible number of moves. To make a move, one of the lines of the board is chosen as a mirror and the counter is moved to the square which is the reflection of its present square in that mirror.
What is the smallest number of moves required to reach square T from square S?
Select one option, then click Submit.
3
4
5
6
7
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 Mathematical Challenge 2003 (2003)
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 Challenge 2003 (2003)