Return to Question

For reference, here is a full-resolution map of World 1-1 (open the image in a new tab for full resolution): [![World 1-1][1]][1]
_{(source: mariouniverse.com)}

Note: At first glance, this may seem like a Kolmogorov complexity challenge on my given input.txt file. However, in reality the challenge is more complex than that because (a) the input.txt I provided is definitely not the shortest possible and (b) there has never been an attempt to create the shortest possible set of keypresses for SMB in this format. The 'fewest buttons possible' known TAS is different because it allows for holding of buttons for a long time, which would add length to the desired output in this challenge. [1]: https://i.sstatic.net/0CkEk.png

For reference, here is a full-resolution map of World 1-1 (open the image in a new tab for full resolution):
_{(source: mariouniverse.com)}

Note: At first glance, this may seem like a Kolmogorov complexity challenge on my given input.txt file. However, in reality the challenge is more complex than that because (a) the input.txt I provided is definitely not the shortest possible and (b) there has never been an attempt to create the shortest possible set of keypresses for SMB in this format. The 'fewest buttons possible' known TAS is different because it allows for holding of buttons for a long time, which would add length to the desired output in this challenge.

For reference, here is a full-resolution map of World 1-1 (open the image in a new tab for full resolution): World 1-1 http://www.mariouniverse.com/images/maps/nes/smb/1-1.png

Note: At first glance, this may seem like a Kolmogorov complexity challenge on my given input.txt file. However, in reality the challenge is more complex than that because (a) the input.txt I provided is definitely not the shortest possible and (b) there has never been an attempt to create the shortest possible set of keypresses for SMB in this format. The 'fewest buttons possible' known TAS is different because it allows for holding of buttons for a long time, which would add length to the desired output in this challenge.

For reference, here is a full-resolution map of World 1-1 (open the image in a new tab for full resolution): [![World 1-1][1]][1]
_{(source: mariouniverse.com)}

Note: At first glance, this may seem like a Kolmogorov complexity challenge on my given input.txt file. However, in reality the challenge is more complex than that because (a) the input.txt I provided is definitely not the shortest possible and (b) there has never been an attempt to create the shortest possible set of keypresses for SMB in this format. The 'fewest buttons possible' known TAS is different because it allows for holding of buttons for a long time, which would add length to the desired output in this challenge. [1]: https://i.sstatic.net/0CkEk.png

In the style of a tool-assisted speedrun with a code-golf twist, the goal of this challenge is to complete Level 1-1 of the original Super Mario Bros game for the NES in your chosen programming language in as few bytes as possible, using only the in-game controller inputs in the format I'll describe below. Your program must output to stdout a list of lines in this format, created specifically for this challenge:

Here, we define 'success' as reaching the flag at the end of Level 1-1 pictured above. The score for this example Python submission, if it succeeded (which it doesn't), would be 44 bytes, or the original length of the Python program.

In the style of a tool-assisted speedrun with a code-golf twist, the goal of this challenge is to complete World 1-1 of the original Super Mario Bros game for the NES in your chosen programming language in as few bytes as possible, using only the in-game controller inputs in the format I'll describe below. Your program must output to stdout a list of lines in this format, created specifically for this challenge:

Here, we define 'success' as reaching the flag at the end of World 1-1 pictured above. The score for this example Python submission, if it succeeded (which it doesn't), would be 44 bytes, or the original length of the Python program.

For reference, here is a full-resolution map of World 1-1 (open the image in a new tab for full resolution): World 1-1 http://www.mariouniverse.com/images/maps/nes/smb/1-1.png