|
|
back to boardIf to walk from 2nd pedestal toward (n-1)th pedestal and to touch dodecahedron on each pedestal twice? F.e.: n = 7 answer: 10 2 2 3 3 4 4 5 5 6 6 Can somebody give me an example demonstrating this way is wrong? For example, n = 4 2 2 3 3 won't work when the stone at 4 The final stone will be 4->3->2->1->2 for example |
|
|