Three hockey pucks A B and C lie in a plane but never in a s

Three hockey pucks, A, B, and C, lie in a plane but never in a straight line. You make a move by hitting one puck so that it passes between the other two in a straight line. Is it possible to return all the pucks to their original positions with 1001 moves?

Solution

With each hit the nomenclature or orientation of the traingles formed by A, B, C

changes .As we are in the original position after 0 hits so, to reach again

the original location or position we need even numbet of hits.Given is 1001 moves, so, it

is not possible to reach original position