This game is generally made for a minigame competition which has different versions. This is the latest one that fixes nearly every bugs in the game, can be downloaded from here: http://forums.nesdev.com/viewtopic.php?p=36686#p36686.. The original website of the creator is [dead link removed]. There's also a paid version which is a little bit different than this version (different bug fix for the phantom (bugged) controller input for example).
Now you can learn, how a god would play a snake game.
Game objectives
Emulator used: FCEUX 2.2.1
Aims for fastest possible time to complete Extreme Quest
Entertains without losing a frame
Manipulates luck/digits heavily
How's RNG works?
The "randomize digit location" is @ $CC84. It uses 5 memory values (from 0080 ~ 0087) that changes multiple times within a frames and the input (0047) also influences them. Usually the "randomize digit location" called by $D930 for the 1st digit, and $CB7E for the remaining ones for 1 time. This TAS manipulates these values before this function calls to spawn the digit. This results in digits spawned at the nearest spot to complete the levels inhumanly fast. Generally, it has a very low chance to get even near to your snake.
Important
This TAS uses a password to start at the 1st level of the unlockable "Extreme quest" mode which otherwise requires to complete 10 (Easy) + 11 (Normal) + 12 (Hard) = 33 levels. Here's a wip that completes only the first 3 quests (which isn't complete because doesn't starts the last, "Extreme Quest" mode): userfiles/info/5544889309315848
I would like to get feedback about
is it worth to publish this game
which version would you prefer (100% -> 33+13 = 46 levels [über boring branch])
I take it that you did luck manipulation to make all the digits appear right next to the head of the snake.
Yes, they were manipulated in the closest location to pick them up in the fastest possible time by inserting "semi random" input. The RNG is based on input which rolls throughout the whole movie. The RNG is modified (1-2 times) within a frame with 3 additional memory value which is depends from the RNG...
I've used different techniques (a lua script to randomize input, spotting different frames to modify only the column or row of the digit, etc) but the fastest technique was manipulating the digit "close" to the head of the snake and later "fine tuning" them to the closest spot.
edit: the reason I didn't finished my lua script for this is because the RNG's locations (3 RNG (helper) value, RNG pos x pos y) is changing from level to level. Sometimes the RNG is called multiple times (for example when you manipulate it in to a wall), sometimes it glitches out (needs perfect luck manipulation for it, and the game will freeze. Doesn't helps in this TAS).
PhD in TASing 🎓 speedrun enthusiast ❤🚷🔥 white hat hacker ▓ black box tester ░ censorships and rules...
So...you just luck-manipulate the next bit of food to be right next to your snake every time? That doesn't seem very interesting to me. The game has all this "terrain" lying around and it never gets used.
Pyrel - an open-source rewrite of the Angband roguelike game in Python.
So...you just luck-manipulate the next bit of food to be right next to your snake every time? That doesn't seem very interesting to me. The game has all this "terrain" lying around and it never gets used.
Let me ask you, what did you expect from a snake TAS?
PhD in TASing 🎓 speedrun enthusiast ❤🚷🔥 white hat hacker ▓ black box tester ░ censorships and rules...
Joined: 4/17/2010
Posts: 11475
Location: Lake Chargoggagoggmanchauggagoggchaubunagungamaugg
MESHUGGAH wrote:
Derakon wrote:
So...you just luck-manipulate the next bit of food to be right next to your snake every time? That doesn't seem very interesting to me. The game has all this "terrain" lying around and it never gets used.
Let me ask you, what did you expect from a snake TAS?
This is the reason you don't need to submit the 100% version. 3 minutes is maximum to stay entertained.
Warning: When making decisions, I try to collect as much data as possible before actually deciding. I try to abstract away and see the principles behind real world events and people's opinions. I try to generalize them and turn into something clear and reusable. I hate depending on unpredictable and having to make lottery guesses. Any problem can be solved by systems thinking and acting.
Joined: 8/14/2009
Posts: 4090
Location: The Netherlands
It's an exercise in luck manipulation, sure, but it was still really boring to watch. No vote, but it's probably worth the Vault.
http://www.youtube.com/Noxxa
<dwangoAC> This is a TAS (...). Not suitable for all audiences. May cause undesirable side-effects. May contain emulator abuse. Emulator may be abusive. This product contains glitches known to the state of California to cause egg defects.
<Masterjun> I'm just a guy arranging bits in a sequence which could potentially amuse other people looking at these bits
<adelikat> In Oregon Trail, I sacrificed my own family to save time. In Star trek, I killed helpless comrades in escape pods to save time. Here, I kill my allies to save time. I think I need help.
Much like the Lunar Pool video, this one is a purely technical TAS and to that I'd vote yes.
And I'd like to see a 100% run, even if it would be direct to the vault.
My first language is not English, so please excuse myself if I write something wrong. I'll do my best do write as cleary as I can, so cope with me here =)
(ﾉಥ益ಥ）ﾉ
Joined: 10/12/2011
Posts: 6438
Location: The land down under.
It's not an interesting tas but as Bisqwit wrote: "A good example of luck manipulation."
I think this should be part of the Newcomer's Corner or part of Demonstartion
Voting Yes, for the manipulation but for Vault and Demonstartion
WebNations/Sabih wrote:
+fsvgm777 never censoring anything.
Disables Comments and Ratings for the YouTube account.Something better for yourself and also others.
I agree that this is a really good technical achievement, and should be published. Though, I didn't find it entertaining, so I'm voting No.
Also, this game looks like a lot of fun. I'll have to try this one out.
I take it that you did luck manipulation to make all the digits appear right next to the head of the snake.
Yes, they were manipulated in the closest location to pick them up in the fastest possible time by inserting "semi random" input. The RNG is based on input which rolls throughout the whole movie. The RNG is modified (1-2 times) within a frame with 3 additional memory value which is depends from the RNG...
I've used different techniques (a lua script to randomize input, spotting different frames to modify only the column or row of the digit, etc) but the fastest technique was manipulating the digit "close" to the head of the snake and later "fine tuning" them to the closest spot.
edit: the reason I didn't finished my lua script for this is because the RNG's locations (3 RNG (helper) value, RNG pos x pos y) is changing from level to level. Sometimes the RNG is called multiple times (for example when you manipulate it in to a wall), sometimes it glitches out (needs perfect luck manipulation for it, and the game will freeze. Doesn't helps in this TAS).
I think this is great information (with a little more detail) to include in your submission text.
You know what would be an interesting version?
A "Bad Luck" version of that where the number is manipulated to be in the worst possible location each time. (yet still be collectable) again it should probably be the extreme quest only.
Joined: 4/17/2010
Posts: 11475
Location: Lake Chargoggagoggmanchauggagoggchaubunagungamaugg
Warning: When making decisions, I try to collect as much data as possible before actually deciding. I try to abstract away and see the principles behind real world events and people's opinions. I try to generalize them and turn into something clear and reusable. I hate depending on unpredictable and having to make lottery guesses. Any problem can be solved by systems thinking and acting.
I did it. This is the scoring system formula. I researched this while I was TASing the game amateurishly to work with this.
The equation is as follows:
( lives ÷ 2 x 10 ) + ( stage - 1 ÷ 2 x 10 ) + n x L
lives equasions [sic] are rounded off to the nearest 10.
stage equasions [sic] are rounded off to the nearest 10.
n = number onscreen
1 = 10
2 = 20
3 = 30
4 = 50
5 = 80
6 = 120
7 = 170
8 = 230
9 = 300
L = Skill Level
Practice/Easy = 1
Moderate = 2
Hard/Extreme = 3
Assuming you want the maximum score possible, the lives come in handy. But make sure the counter next to the score does not exceed 2560 as it rolls back to 0.
The strategy for the max score is to eat all the apples and collect the randomly appearing star before getting all the numbers. If you get stuck with no way out, hearts will save you.
