Indeed wikipedia's description of the algorithm is¹ was wrong. Palmer's own description is.
Yes. You might get a faster solution by starting from a more carefully chosen initial cycle however the algorithm will succeed starting from any valid initial cycle provided that the graph meets Ore's condition.
I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.