# Moving coins in a grid

Here is a great puzzle from Ed Pegg Jr.

Place two coins in the center cell of the following grid. Now you can choose a coin X and move the second coin Y one cell in the direction of the arrow under coin X. Coins cannot leave the grid. Can you find a sequence of moves that bring both coins to their starting location in the center of the grid? Good luck!

# ⭣

Grid as an image

• What exactly is the question? It seems there are both reachable states from which you can go back and reachable states from which you cannot go back (and non reachable states from which you could come back for that matter). Commented Jan 8, 2021 at 2:29
• The question is how do you bring both coins to the starting position? Commented Jan 8, 2021 at 3:52
• What I mean is: it depends. On the initial sequence of moves. Do you want a solution for any such sequence or am I allowed to choose it? Commented Jan 8, 2021 at 4:16
• I see where the confusion was. You need to find a sequence of moves that brings both coins to the starting position. I will rephrase the text in the puzzle. Commented Jan 8, 2021 at 4:22
• Just to be clear you can move X where you like - it's movement isn't governed by the tile Y is on? Commented Jan 8, 2021 at 11:12