implemented 'linear build', which never makes a wrong move. Compute the intersection of legal moves and children then choose one. Tends to favor long knots, because it will only even consider finishing if it would be legal to do so. Maybe I should write one that starts from the Ti and proceeds back in time?
only completes 69 knots
Testing
Builds exactly 85 knots