User blog comment:Ubersketch/Turing Machine Contest/@comment-30004975-20190523202826

I submit the TREE(3) state TM where every state except the last one prints a 1, moves right, and changes to the next state, and the final state does the same except it halts. (AKA you should probably have state/color limits)