in reply to Re: At the risk of saying something stupid-but-obvious about Roman Numerals
in thread At the risk of saying something stupid-but-obvious about Roman Numerals
I would have expected to find such a presentation presenting a problem which actually
requires a search of an intractably-large space ... and, since this one clearly doesn’t
It does for a golfer. :-)
You see, the search is required to improve the previous shortest known Python solution
by a single stroke by replacing the previous shortest known magic formula:
with one in this form:
which is one stroke shorter.
This is explained in more detail in the introductory "Lookup Table vs Magic Formula" section of The 10**21 Problem (Part I).
But it would be a lot more interesting if the most-efficient algorithm
for solving the actual representative-problem were what is
presented “in the least number of keystrokes.”
The shortest algorithms for solving the Roman to Decimal conversion problem have already been presented in: