Posts for flagitious

1 2
9 10 11
20 21
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Is ball 8 gotten in the same area as ball 7? I left there a little prematurely after getting ball 7. And I'm stuck where Blublu was in the Lab with the square of lasers.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Dang just went into the area where there are several sets of walls each a different color, and I get to a part where the one that is active changes with which ball I am, but apparantly I need either the 6th 7th or 8th ball to continue. If the music weren't so relaxing I'd be pissed off right now.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Hey cool game, I just got the forth ball (before third as well) and don't know where to go yet. I'm sure alot of you have some sort of USB controller and would like to use it for the game. There is a program called joy to key that is great for linux, and someone make a windows version that is also great, here is that windows version (I host because it was very hard for me to find with google).
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Nitrodon, oops you're right its only for current group of 4, I must have came to that false conclusion before I figured out the groups of 3 thing and thought it was from the other people or something, sorry. I'm not about to try to follow that trace, speaking of trace, what programs do you use to follow the codes progress while the game is running? I ask because recently I was trying to figure out the randomization of magicite -> ragnarok and I was doing a lot of looking at the assembly code, but nothing interactive with the game runnning and it was very difficult despite it being commented by assassin17 MaverickHunter: There is a bug that lets you get the airship anytime in the WoB (but it is of no use for a TAS because it requires playing up through the floating continent and dying, being reset to where you last saved but in the airship, see here for more details). Then you use this to skip the boat ride to thamasa and instead fly to kohiligan to get shadow (you can't have gotten him before). Then you fly to thamasa and play like normal, when you get to WoR the boat ride can still be done and if you take it you'll end up in the WoB, you need Locke and Terra because they are expected to be in your party for that event and it will freeze if they aren't. There are probably many other ways to get back to the WoB using this type of bug, but this is the first one I tried. Opera house comes to mind, but I couldn't test this in my game, because I skipped reading the letter in Owtzer's house which triggers the Opera house to let you in.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Catastrophe: On page five Nitrodon figured out how the spell list arrangement works. Aw man I can't believe I did all that work to figure something out when all I had to do was click page 5 doh! Yup, it does use the combined spell list. I didn't mention this, but I think it uses combined list of all characters that you have (they don't have to be in your current group of 4), this could make it slightly more convenient you. I think I'll test the Dragon to see if using the It works, I was only able to do the version where I go into the battle with the spell disabled (went in with 0 mp) and get away. There were no side effects besides the items that I was aware of. I used this in my min step run, which I have completed now, in 5006 steps. I went through at lvl 99, I like your idea of also low level, but in order to achieve this I think I would have to sacrifice steps to be able to still win, or a ridiculous amount of luck manipulation (which I'm not about to try), and my number one priority was just to see how few of steps I needed. BTW are you still trying to use airforce to warp with zone eaters or something? That would be pretty cool. Erim: It involves doing the FC bug, skip talking to Leo at Albrook, getting Terra and Locke in the WOR, and talking to Leo in Albrook, WOR. Hey you say that like its a widely known bug, but as far as I know it had never been done before.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Catastrophe, it seems one delima of using the sketch bug is that you have to learn spells first, such as Mute. I'm working on a fun run where my goal is to minimize steps and I also want to use the sketch bug (for items only, warping seems way to complicated for me), but to get Mute requires Siren which requires 10 extra steps. I think it is possible to do the sketch bug with other spells in place of Mute, but only if the spell list is 'compressed' in certain ways so that a spell like it is in the 28th spot like MasterZed's guide says. I know there are other ways to do it because like 10 years ago when I first played the game I accidently did the sketch bug, and I know for a fact that magic order was set to 1 (because I still have the save file on the cartridge). I will be experimenting how the spell list compression works and hopefully any faster ways to get the sketch bug to work. Also if you know anything that might help me do it without Mute I'd like to know too. Edit: It's looking like the compression causes you to need at least 14 spells to get down to the 28th spot so I guess this will be of no help to you, which you probably already knew, sorry. Edit2: Good news is the spell list locations are shared for each character in your party, so instead of 1 character having to have 14 spells its the whole party combined needs 14 spells total, which makes it much faster. In reality you might need a little more than 14 to get one that works on the 28th spot because sometimes two spells are in the same row, and also there might not be a way to arrange it so the last spell is the one that works. Edit3: The algorithm used to compress is this: break all the spells up into groups of three { if learned any spells in current group of three draw this group (blank spots for place holders of unlearned spells) } loop if groups left so theoretically you only need 10 spells spread through your whole party to get a spell in the 28th spot, this shouldn't take long at all for reference here is the list of spells in the order that is relevant: fire ice bolt poison drain fire 2 ice 2 bolt 2 bio fire 3 ice 3 bolt 3 break doom pearl flare demi quartr x-zone meteor ultima quake w wind merton ____________ scan slow rasp mute safe sleep muddle haste stop bserk float imp rflect shell vanish haste2 slow 2 osmose warp quick dispel ___________ cure cure 2 cure 3 life life 2 antdot remedy regen life 3 So I *think* the following spells could work for sketch bug (and only these): poison, break, flare, mute, muddle
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Nah, In some levels and thus worlds it will give you a gold if you save almost all of them. This is because the designers thought it was impossible or too hard to save all of them, but in some cases they were wrong.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Wow impressive, I'll check that out now, thanks. Edit: Easier than I thought, due to the use of death, but still, nice.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Tub wrote:
well, there's the "only 1 star per game"-quota, and there's already a star at the 96 exit run. The question is not if this run is star-material, the question is whether this run or the 96-star-run deserves the star most.
That's a good rule, I didn't know about it. This run deserves the star because it incorperates several new techniques and because the other run is too long. Not to say the 96 exit run is bad or has less effort put into it (infact the opposite is true), but in my opinion it is impossible to keep someone entertained watching the same game for over 20 minutes, unless they are some sort of expert at the game and enjoy the game to a deeper level, but most of the general public does not meet this criteria. Since Fabian is working on a remake of the 96 exit, there will be another time for this decision to be finalized, but meanwhile this run deserves the spotlight.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
One goal for a TAE (tool assisted entertainment run), could be to finish every race without being ranked out, but still end up in overall 8th place. I'm not sure how entertaining this would be, but it would be insanely difficult because the cpu tries to get people to finish in the same order they did in the first race of each cup. If you get 4th every time, you will have 5 points, so if you can make a different person get 1st everytime, and then the 2 other players get second once, you'll have last place. In practice that might be too hard, but you have several more second and third place points to give out as a buffer.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Sketchie wrote:
Space: 2. You will need one lemming to explode the platform near the end of Perpetual motion to allow a lemming to jump down and platform to the goal.
Its actually possible to complete that level without losing a single lemming. If your goal is to save every lemming possible as opposed to just getting gold everytime, the best you can possibly do is 4 lemmings lost in total (2 in one of the levels from polar, and 1 in two levels from classic)
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
I don't think this will be able to catch up and be one of the most downloaded movies unless it gets a star. (The green thing it has now isn't a star, it does not show up in the 'best movies' section). I think this should get a star: The previous version had a star (although it was removed after a while) The previous version was the most downloaded avi on the site This is better than the previous version It doesn't even need comparison to the previous version to warrant a star in its own right: Its speed is without compromise It is played in an entertaining way It is of a classic game that most people have nostalgia for.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
I can't tell if you are using the opposite day theme when you say the opposite day joke is not funny? JXQ: I would never try to obsolete it by winning by a few frames, that would be pointless and not worth the effort. But looking at it in more depth I still don't see any feasible way to improve it past a few frames. Also I look back at my old version that started incorperating the hopping glitch (started right after submitted the old version), and where I left off (at the end of the castle, (gave up because bad fadeout lag)), you were 6 frames ahead.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
How could I vote no (although it might be in my best interest to do so)? I was thoroughly impressed. I will have to try my best to re beat it, but I don't think that is going to happen; this is looking pretty perfect.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Ozmodiar: its not exactly "equal efficiency." Erim saves alot of time in places by aiming for pure speed, such as not getting the chain saw, or killing 024 super fast. This is not so say catastrophe's run is bad, I think he is aiming more for entertainment than speed, although when I watch both they both look perfect to me.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Your point would be valid except for the following *PERL isn't the best UNIX choice for web scripting *PERL is not UNIX, PERL exists for Windows too *UNIX books do not devote any chapters to PERL This is based on the only Linux/Unix book I own: Linux in a Nutshell, 800 pages long and less than 1 page of it is about perl. I'm sure there are linux books out there which go into more detail about PERL, but there are also Windows books that go into more detail about AOL. I think you raise a good point that PERL is not a good choice for most web scripting applications, and I agree completely. But taking that farther to say linux is bad, is completely wrong. It is unfortunate that you are being forced to use the wrong language for the job, and for that I apologize.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
That's like saying Windows sucks because AOL deletes your email after a while even if you haven't read it yet.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Fabian, your idea sounds good, but either I fail to comprehend how it works or it would need to add a new unique id everytime you save state, and this list could get quite large after a while. FractalFusion, we don't need to be told how to avoid the problem, we already know how to do that, this topic is to provide a way for those who don't know about it to never have to learn about it, if it can be implemented.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Post subject: Solution for a desynch problem in all consoles
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
A common problem occurs when you load a state in read only mode, in which you have previously redone something before that state. Now if you save state while playing in read only, but then later rerecord from that state you will have an invalid movie that will desynch. For those who don't know about this it might sound a little contrived, but it can easily happen by mistake. This is not a serious problem, but there is an easy solution: that would be, when in read only mode during a load state make sure that the state is from the correct movie as usual, but in addition, go through every frame of input and check to make sure they are the same, if they differ then display snapshot not from this movie. I think the only disadvantage to the solution is that it might seem a little slow, but it would theoretically only be twice as slow as saving a state, and it could be improved to the same speed by storing the md5 sum of all the inputs in the state, then all you would have to do is calculate the md5 sum of the movie file inputs upto the current frame. I said the problem is not that serious because if you know about it its easy to avoid, but I think the biggest problem is if someone claims a desynch it is hard for people like Nitsuja to track it down, because he won't know if it was their mistake or the emulators that caused it. I bring this up because Erim was working on FF6 at the imperial base in Sabin's quest and had a desynch problem, after he resolved it, I told him to play the movie from the beginning to make sure his save states were current. I thought that the problem may have just been the load in read only thing, but then it happened again, and it cost him alot of work and frustration. Had we been able to narrow it down, maybe he could have avoided more problems by being more suspicious of emulator bugs and rewatching progress often. Anyways just thought it would be could to discuss such options and curious if any emulators do this already?
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
First level looks good, only problem I see is it looks like at the start screen you could have started to scroll downwards to hit play much sooner. I liked the rope thing you did, good way to save alot of time. You can press A and then scroll using the cursor instead of moving it all the way to the edge, I don't think this would have saved you any time at all in this level, but there are lots of places it will help, and as far as I can tell there is never a time when regular scrolling is faster than A scrolling.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Ok thanks, don't know why 19 exit sounded right.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Question for JXQ: in your SDW 19exit, in Bowser's Star World, how come you don't start to fly until mid way though the level? Not the right topic for this, but I don't see the a SDW topic around.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Kara Jade wrote:
Does flagitious have a 100% items run in progress?
Hi I never worked on a 100% run for this. I wish you best of luck and hope you enjoy making the run. If you haven't decided about whether or not to get the bomb/arrow capacity upgrades, I would suggest not to, because it will take several minutes and add nothing to the entertainment. Also there are some minor errors that I know of in the existing any% run, the most important of which you should be aware of is the 2nd crystal dungeon boss, once you get the fuzz balls off, in addition to hitting it with the sword you can also hit it with the fire/icerod, this allows it to be killed before going into the ceiling a second time.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Randil, your U version completed is very good. I think you should submit it. I don't see the need to continue to use the E version just because that is what the previous version used. If I make a tas of this game I'll do it on the U version too.
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
Experienced Forum User, Published Author, Player (201)
Joined: 7/6/2004
Posts: 511
Ok, what is the reason for the E version instead of the U version? Is it to remain consistant with the previous runs? Would the U version run 17% faster. Thanks for the WIPs Randil
g,o,p,i=1e4,a[10001];main(x){for(;p?g=g/x*p+a[p]*i+2*!o: 53^(printf("%.4d",o+g/i),p=i,o=g%i);a[p--]=g%x)x=p*2-1;}
1 2
9 10 11
20 21