Science, Mathematics, Board Games, Hex, Algorithms.
terminating at u would mean re-visiting the vertex, which we have shown cannot happen, whilst terminating at u’ is not a possibility due to an orientation contradiction. That a simple path starting at vertex u cannot terminate at vertex u’ is due to the fact that the tour along ζ that is obtained