Proves that there exists a fixed tie-breaking rule and a fixed start position by which Warnsdorff's algorithm has a solution to the knight's tour chess problem in 3xn boards, where n is greater than or equal to 14. Description of the knight tour problem; Nondeterminism of Warnsdorff's...