Post subject: How to test Branches of input?
Editor
Joined: 3/31/2010
Posts: 1466
Location: Not playing Puyo Tetris
I wanted to ask how can I test a list of inputs and see which is the fastest for a given section? In particular I am playing on the Apple IIe core and playing Wishbringer. I want to test over 2000 methods of entering input and see which is the fastest for that particular set of inputs. My Inputs look like this in plain text.
N, N, N, N, E, U, W, N, U, E, S, U
N, N, N, N, E, U, W, N, U, E, S and U
N, N, N, N, E, U, W, N, U, E and S, U
N, N, N, N, E, U, W, N, U, E and S and U
N, N, N, N, E, U, W, N, U and E, S, U
The issue is loading times for the disc drive does appear to vary based on my inputs. Does anyone have a suggestion or advice or is willing to help me figure this out so I don't have to brute force test over 2000 lines of the above text?
When TAS does Quake 1, SDA will declare war. The Prince doth arrive he doth please.