I would like to acknowledge Rick Klement, Bart Lateur, Matthew
Byng-Maddick, Keith Ivey and Sean McAfee for all finding the
wacky "Tall Trees"/"Toothpicks" solution.
-p $_ x=$|--&y|||c&~(y|a|||y|e|||y|i|||y|o|||y|u|||y|y||) 57 klem
-nl ($.|y|||c|y|a|||y|e|||y|i|||y|o|||y|u|||y|y||)&1||print 59 bart
-n 1&($.|~y|||c|y|a|||y|e|||y|i|||y|o|||y|u|||y|y||)||print 59 byng
-ln 1&($.|y|o|||y|e|||y|u|||y|a|||y|i|||y|y|||y|||c)||print 59 ivey
-ln 1&($.|y|||c|y|a|||y|e|||y|i|||y|o|||y|u|||y|y||)||print 59 sean
-p 1&($.|~y|||c|y|a|||y|e|||y|i|||y|o|||y|u|||y|y||)&&y|||cd
60 byng
You might say that Rick's is the best because it is the shortest.
On the other hand, Matthew's 60-stroke solution has the highest
ratio of | characters to golf score, as shown below.
klem 57 27 0.4737
bart 59 30 0.5085
byng 59 30 0.5085
ivey 59 30 0.5085
sean 59 30 0.5085
byng 60 31 0.5167
/-\ndrew
