Double Saw Bye (2009)

Problems like these bear a lot of similarity to CS brain teasers, such as exchanging N items without using N + 1 slots. [1]<p>I wonder if that contributes to why model railroad clubs (like the TMRC) and early computer hobbyist groups intermingled so easily.<p>[1]: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;XOR_swap_algorithm" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;XOR_swap_algorithm</a>

I did not get any hits on &#x27;single saw bye&#x27; - Is that the case where a siding is connected to the main line at only one end? When I get a chance, I will see if I can figure out that one (I guess there are two variants of the single-junction siding, one with one and one with two switches.) Then there is the question of the minimum-length siding for arbitrarily-long trains. There seem to be some similarities to the Towers of Hanoi problem.

I love this kind of problem solving. Doing this safely is probably a time consuming pain, yet less time consuming and dangerous than steaming several miles backwards.

I don&#x27;t see why you won&#x27;t have maximum train length for every part of track &amp; check that beforehand while routing.<p>Reminds me of the infamous MTU networking problems.