In the game illustrated here, the black counter • has to be moved from its “starting position” to its “target position” (shown here as circle ).
The aim is to achieve this in the smallest number of “moves”. To make a “move”, you have to choose one of the fifteen marked lines as your “mirror” and move the counter • to the position which is the reflection of its present position in that “mirror”. What is the smallest number of “moves” required to reach the target position?
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 1999 (1999)
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 1999 (1999)