And I would fully accept that this would keep a non-challenging TAS from being published to vault except that there are already precedents of such runs being accepted. There is one unique solution, and there is no other strategy that could be taken. There is only one way to get an optimal run, and that is by hitting the right buttons at the right time. (Judges, please let me know if this is incorrect and I'll update the submission accordingly.) In this case, I could certainly see an argument that the gameplay in this TAS is 'trivial'. Unfortunately, there's no definition provided for what constitutes 'trivial' gameplay, so I looked at a few online dictionaries and the closest thing I can find for what I think was intended was 'Simple', perhaps overly so. However, in case you disagree with the above, and believe that TASing the game is not challenging, this TAS can still be accepted if the gameplay is not 'trivial', as per sentence #1. If you agree with my reasoning above that this is a challenging game to TAS, then we needn't go any further. This requires additional research, development and testing to ensure optimal play entering or leaving any transition screen.Īs I mentioned above, the fourth sentence in the rule states that if TASing the game is considered challenging, then even 'trivial' games are acceptable. In addition to tracking the location of the pointer and knowing when to loop back to the beginning, now the script also has to know when to stop typing because the game has hit a transition screen and then know to begin again on the first possible frame once the transition is complete. TASing these levels requires determining where the starting point is and figuring out when to loop around to the beginning. When it hits the end of the list, it sets the pointer to the beginning of the same list and goes through it again. The levels begin pointed to a random starting point in a random preset list of words/letters in memory, and steps through them. A further complication involves determining what text is coming next. This means that the strategy used in Level 1 does not work here, and a completely different strategy is required to make sure the script is keeping the input flowing just ahead of what the system can accept. Level 2 and 4 remove all limitations on the speed of input, meaning that multiple keys are accepted per frame.Look for the memory state to acknowledge the typing of the previous letter, and then type the next one. Level 1 is as you might expect from a game like this.Furthermore, as the levels behave differently, each required unique strategies and scripts to ensure the typing was optimal. This was entirely unfeasible manually and could only be practically done by creating automated scripts. This TAS required over 224,000 frame perfect inputs.
0 kommentar(er)
