If a solution is known moving from peg A to peg C, then, by renaming the pegs, the same solution can be used for every other choice of starting and destination peg.
Igra se nepoznavalcem zdi nemogoča, čeprav je rešljiva s preprostim algoritmom.