The puzzle provides a valid ten-pin bowling scoresheet (as suggested by the title) for ten players. A reasonable idea would be to calculate the final score for each player. Now, taking the first letter of each name spells out ARITHMETIC. Indeed, a strike (X) looks like a multiplication symbol, a spare (/) looks like a division symbol, while a gutter ball (-) looks like a subtraction symbol. Using these interpretations, we can see that each row gives a valid arithmetic expression. Evaluating each expression (obeying the usual order of operations) gives us an integer each time, which suggests that we are indeed on the right idea.
The next step is found by looking at the names again (the oddness of some of the names would suggest that first letters are not the only piece of information contained within them). Indeed, taking the last letter of each name spells out EUCLIDSALG. This is referring to the Euclidean Algorithm, which is a method for calculating the Greatest Common Divisor of two integers. This implies that we should calculate the GCD of the two integers that we have produced in each row. Indeed, each GCD is no greater than 26, so we can convert these values to letters.
Finally, if we arrange the letters by decreasing bowling score, we get SHANEWARNE (a famous Australian bowler, although in a different sport). | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||

The answer is: shanewarne |
---|