Posts for FractalFusion

1 2
59 60 61
128 129
Posted: 8/24/2012 11:00 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
jlun2 wrote:
How do I encode my WIP I posted in the Ao Oni thread? Since Hourglass refuses to start capturing Video, will this affect the run if I submit it in the future?
It's not a good sign if hourglass cannot encode it properly. How does hourglass refuse to start capturing video? Does it make a AVI file?
Posted: 8/24/2012 10:57 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Tools -> Start AVI Recording Codec: Install Camstudio Lossless codec for best quality, but x264 codec is acceptable if the settings are good. If you wish, you can give me the VBM to encode.
Posted: 8/24/2012 10:32 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
This is how I do my encoding stuff: 1) Install CamStudio lossless codec and VirtualDub. Also install x264, MP4Box, and NeroAACEnc if necessary. 2) Dump the movie using CamStudio (see video dumping page). 3) What I do at this stage is edit the video in VirtualDub using AviSynth. This is strictly not necessary but I like to patch the video. I encode the video with CamStudio again (doing this decreases the video size a lot, but it is still large). 4) Now if I want video even smaller, I encode the video using x264. This results in a very small video file (the audio is not taken) but it requires the most time to encode at this stage. 5) I save the audio in VirtualDub, and encode it using NeroAACEnc. Then I use MP4Box to put the audio and video together into an MP4 file. Because my encodes are usually intended to be uploaded to streaming sites like Youtube, I don't use Dedup. I'll give more information if necessary.
Posted: 8/24/2012 9:35 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Download encode from 1fichier: http://b4yag9.1fichier.com/en/
Posted: 8/24/2012 8:57 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
This run looks good. Encoding.
Posted: 8/22/2012 3:22 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Regarding the movie that failed to clear the ending scene, the ending was perfectly scrolling by itself, but then it stopped when it reached "本当か…？！". No clue what was wrong with that. jlun2, what is wrong with the "normal ROM" that makes it unbeatable? Is there a ROM which is not (b) and is beatable? By the way, VBA v24 might have inflated the rerecord count.
Posted: 8/21/2012 10:47 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
I'd like to know what a manupilater is.
Posted: 8/20/2012 8:19 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Anyway, here's the comparison video I made: Mediafire (~20MB): http://www.mediafire.com/download.php?7s2lbxsjmiax7m7 Youtube: http://www.youtube.com/watch?v=vUj9ZEWnO1M And the AVISynth script I used: http://pastebin.com/mKC7fuGP Note: I entered the pause and subtitle timings by hand. The timing numbers occur directly on the clip as it is modified. Also, I think it is necessary to feed x264 a video with a width which is a multiple of 4; otherwise the encode is skewed and messed up. Also, I don't know why the internal video dumper of VBA v22 and others is inconsistent with the frame display in emulator, but it may have caused all sorts of problems we never knew about for the last 5 years. Edit: That actually makes VBA v24 more accurate than VBA v22. In the sense that its frame display more accurately indicates the dumped video, of course. I don't know much about emulation accuracy to comment on that, and v24 is known to artificially inflate rerecord count, whereas v22 doesn't. Edit 2: Here's a comparison of SML TAS frames in v24 emulator, and the corresponding frames in v24 video dump. First number is frame in emulator, second is frame in video dump, and third is second minus first. Each measurement is taken when Mario first appears in position at the start of a new level from beginning of 1-2 onward, except for the last measurement which is when "5000" appears after beating the last boss. 
2311 2313 2
4531 4534 3
8289 8293 4 
10686 10691 5
12864 12870 6
20228 20238 10
23535 23545 10
25954 25965 11
29884 29896 12
33087 33100 13
36046 36060 14
43728 43742 14
So it is still inaccurate, just not as much.
Posted: 8/19/2012 10:01 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Mediafire (~24MB): http://www.mediafire.com/download.php?2hb7hllzzlg56jm Nicovideo (account): http://www.nicovideo.jp/watch/sm18659146 Nicovideo (no account): http://www.nicozon.net/watch/sm18659146 Comparison between versions: 
hammer: 157 121 (36)
keyholder: 181 139 (42)
first goonie: 565 481 (84)
warp (moving platform): 233 215 (18)
boomerang and glasses: 323 368 (-45)
hyper shoes: 189 171 (18)
hammer transition (from dark to light cave): 120 132 (-12)
goonie (light cave): 322 316 (6)
diving suit: 322 301 (21)
goonie (underwater): 697 667 (30)
goonie (ice cave): 415 386 (29)
warp (reverse of first): *236 218 (18)
warp (near beginning): *438 444 (-6)
goonie (red rock): 542 506 (36)
warp (red rock to window area): *237 219 (18)
to underwater 2: 370 376 (-6)
goonie (underwater 2): 261 231 (30)
leave underwater 2: 298 292 (6)
warp (window area to red rock): 238 220 (18)
warp (back to beginning): 371 377 (-6)
hammer to new area: 307 301 (6)
next area: 234 216 (18)
hammer in dark: 121 133 (-18)
last warp to underwater 3: 241 223 (18)
total: 359
All numbers are frame amounts. All timings are from the first non-black screen upon entry up to the first non-black screen after exit. Only those with variable text is considered. First number is timing from published run, except where * is displayed, in which case it is from the nicovideo 15:51 run. Second number is from this run. Third number is first number minus second number. Comparison due to use of death: 
first death: 849 643 (206)
second death: 530 484 (46)
total: 252
Timings are from the first non-black screen upon entry into area where death occurs in this run, up to the first black screen after exit of same area. Otherwise, it is the same as above.
Cardboard wrote:
I haven't played the game in some 15 years, but do you have to save all of the Goonies or is Annie enough?
I'm sure you have to save all of the Goonies. Otherwise, someone would have made a run without saving them already. Also, an offhand statement at TVTropes seems to imply that they must be saved in order to beat the game.
Posted: 8/19/2012 6:49 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
I had a comparison encode ready but I didn't upload it yet in order to respect みり (who uploaded http://www.nicovideo.jp/watch/sm18637671) and give the video as many views as possible. Then alpha09jp uploaded his own comparison encode. Oh well. Comparison encode by alpha09jp: Account: http://www.nicovideo.jp/watch/sm18657108 No account: http://www.nicozon.net/watch/sm18657108 Normal encode on nicovideo: Account: http://www.nicovideo.jp/watch/sm18637671 No account: http://www.nicozon.net/watch/sm18637671 If anyone wants to know how I did my own comparison encode, I can upload to Youtube and provide the Lua script I used.
Posted: 8/18/2012 8:10 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
The run does not ignore delays caused by bonus screens. The time saved when Mario is already Fire Mario when he walks up to the fire flower bonus more than makes up for the time obtaining mushroom and fire flower in 3-3. Same reasoning for obtaining mushroom and fire flower in 1-2.
Posted: 8/18/2012 3:17 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
I've watched this movie as well as the other Goonies 2 movies, and I can definitely say that this is a much better effort from McBobX, including the use of a new trick not present in any movie (including both nicovideo movies) so far to save over 20 seconds from the previous submission.
Posted: 8/18/2012 12:12 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
This game looks silly. Also, what's up with the sound effects at the last boss?
Posted: 8/17/2012 3:45 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
I'm currently trying out a comparison encode. I video dumped this submission in v24 and the old movie in v22, and I noticed some things: * The frame difference at the start of 1-1 is only 1 frame in favor of the old movie. * The frame difference from 1-1 to 1-2 is only 1 frame in favor of the new movie. Since the submission says that the frame difference should be +24 at the start of 1-1, the encodes might be treated differently than what is seen in emulator. Also, I noticed that this submission does a pause after doing the out-of-bounds glitch in 2-3 right before touching the axe. Is this pause necessary? Edit: In the encode of the old movie, the few seconds after the final boss is defeated takes longer than in the new movie.
Posted: 8/15/2012 6:40 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
This TAS is pretty good. Though I wish there was a comparison encode handy, but those types of encodes seem hard to make. Yes vote.
Posted: 8/15/2012 5:28 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
zaphod77, if there is anything you would like me to translate, just ask me.
zaphod77 wrote:
Many Japanese are willing to give permission, but they wish to be asked. do not just blindly upload to youtube. While giving credit is good, they want to be respected.
I don't know much about this, but I would like to know more. Could you link me to some sources? BTW, #4 is "Choro Q Wonderful!". The Choro Q series is popular in Japan.
Posted: 8/15/2012 5:10 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
If anyone has trouble with seeing the submission page while logged in, do the following: - Refresh the page. - If it doesn't work, clear the TASVideos.org cookies and try again.
Posted: 8/12/2012 2:28 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
July 2012 TAS Ranking: Link to video The entry barrier for 30th place for June 2012 was over 25K. This time it was less than 20K. This is a far cry from the 40K+ barriers earlier this year. I suppose the time of year has something to do with it. Also, #27 is a joke. It didn't even last 8 seconds on the video.
Posted: 8/11/2012 2:27 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
mtvf1 wrote:
No no no, you should post your proposal in three months ago, indeed. http://tasvideos.org/forum/viewtopic.php?p=313987#313987 This tas has wasted me too long time. All right, I will go on tasing megaman battle network 3, and please don't say this is a bad game choice again until I complete.
Sorry to hear that. It's very hard to take when a movie you spent so much effort on is rejected. One of my movies (#1896: FractalFusion's GBA Tom Clancy's Splinter Cell: Pandora Tomorrow in 53:17.47) was rejected even though I spent 46231 rerecords on it. I don't remember exactly how many hours I spent, but assuming around 750 rerecords per hour, that is over 60 hours. I accept the rejection though, because part of the problem was that I didn't do enough to get others interested (lack of encode, for one), and I would rather leave it in the past and do newer things. BTW, I never deemed that only 45 minutes of this run was essential, although I might have said something before that allowed others to assume that I did so.
Posted: 8/10/2012 6:39 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Interesting. I wouldn't have done any better on my first try without spending too much time on it. While I suppose the purpose of TAS you made is to get used to doing a TAS, the current published run of SMB3 uses a lot of technical know-how and I wouldn't try beating it unless I know exactly how it works, and how to beat it.
Posted: 8/10/2012 12:55 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Good job, p4wn3r. I had the same function f (actually, I used f=sum((n+1-i)*a_i), because I tend to think big-endian when it comes to math) and intentionally designed the problem around that function. I was hoping you wouldn't put down the polynomial solution; though, if you did, I would have just thrown in another option, something like "a → a+1, b → b-2, c → c+2, d → d-1", to force you to do it the way I intended. :p The polynomial solution is as follows: Suppose that the process does not end in a finite number of steps. Since there are a finite number of states for the sequence, then there exist a positive number of steps that take a sequence to itself. Consider the sequence as the coefficients of a polynomial in x, where the numbers at the beginning of the sequence represent the coefficients of the highest degree terms in the polynomial. Because the two possible options apply always to four consecutive numbers in the sequence, we can write: (-x3+2x2-1)f(x)+(x3-2x+1)g(x)=0 where f and g are nonzero polynomials with nonnegative coefficients. Any nonzero polynomial with nonnegative coefficients, when evaluated at any x>0, gives a positive number. Therefore, -x3+2x2-1 and x3-2x+1 must have opposite signs or both be zero at all evaluations x>0. Plug in x=1.1, and you get 0.089 for the first and 0.131 for the second, which is a contradiction. Therefore the process must end in a finite number of steps. This argument can be applied to other pairs of polynomials as well, such as -x3+3x2-1 and x3-3x+1. However, this does not apply to -x3+x2-1 and x3-x+1; indeed, it is possible in this case for the process to go on forever.
Posted: 8/9/2012 12:33 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
p4wn3r wrote:
Consider a function f taking the sequence as an argument, such that f = sum( min(2a,k-b,2d) + min(2k-2a,c,2k-2d) ), where the summation is done for each consecutive tuple (a,b,c,d).
You're on the right track, but there is a problem with the statement "In order to increase the value of min(r,s,t) you have to increase both r,s and t." The value of min(r,s,t) can increase even if only one of r,s,t is increased; as long as it is the smallest of the three values when it increases. It is a function f though. There is also a solution by casting the problem in terms of polynomials that I overlooked when I stated the problem, but doing that way is much harder, I think.
Posted: 8/8/2012 7:27 PM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
You don't need to express symmetry of Sn, but I don't understand what you mean by this: "given a permutation that has a k-cycle, you can always extend it so that you have m! ones". I'd express it like this: Permutations in Sn\S have at least one cycle of length k, k>m. Two permutations p and q are in the same class if q can be formed from p as follows: Let C be the cycle in p containing the smallest number which is contained in a cycle of length greater than m. In C, take the smallest m numbers. Then q is formed from p by permuting these m numbers. Note that every permutation of these m numbers results in a distinct permutation, because at least one number in C is fixed. The elements of Sn\S are partitioned by these classes, since every permutation is contained in exactly one class. Every class has size m!. Therefore, m! divides |Sn\S|=|Sn|-|S|. Since m! divides |Sn|, then m! divides |S|. Here's another question: Let n>3 and k>2. Take a sequence of integers (ai) of length n, where each integer is between 0 and k inclusive. Apply the following step to this sequence over and over: 
Take any four consecutive numbers in the sequence and call them a,b,c,d from left to right. Do one of the following two:

* Replace a with a-1, b with b+2, and d with d-1, provided all numbers remain between 0 and k.
* Replace a with a+1, c with c-2, and d with d+1, provided all numbers remain between 0 and k.
Prove that eventually, the whole procedure must come to an end (only finitely many steps can be taken) no matter what.
Posted: 8/7/2012 4:45 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
OK, here goes. Let m, n be integers with m≤n. Let S be the set of permutations of {1,...,n} consisting only of cycles of size less than or equal to m. Prove that m! divides |S| (the size of S).
Posted: 8/4/2012 10:11 AM
Quote
FractalFusion
Editor, Experienced Forum User, Published Author, Skilled player (1941)
Joined: 6/15/2005
Posts: 3247
Glitchy TAS of 2013 Gameboy TAS of 2013 PSX TASer of 2010
Encoding. It will take a while though. ---- Edit: Here is an encode: Minus download (~428MB)
1 2
59 60 61
128 129