Thanks Lil_Gecko, that script is great! I should be continuing work with the glitched run at some point; almost done with disc one.
.......
Why not submit it? Finding out how fast it can be completed is one of the main points of this site isn't it? I think the glitchless run would be much more fun to watch, but that doesn't mean that the glitched run isn't valuable too.
Previously we only published movies people found entertaining ...
Regarding the glitchless run: I think you should refrain from using stutter-walking and the menu trick, though I wouldn't have that much against the former.
Of course I did that. Specifically I'm interested in seeing the game beaten in the fastest time, within limits. I feel opening the disc tray is too much hardware abuse. I am aiming to abuse the game's software rather than the hardware.
EDIT: Solved. Battle animation flag updates every 4th frame, whereas the Pause flag updates every frame. So it is possible to pause-unpause before an animation frame goes by.Language: C{ if ( !*(sub_676578() + 2644) ) { EnterCriticalSection(&CriticalSection); ++dw_FrameCounter; /* Increment FrameCounter by 1 */ if ( !b_AnimFlag ) /* Is Animation frozen? [?] If yes, leave */ { /* If Animation not frozen: */ if ( !b_PauseFlag ) /* Is Battle Paused? If yes, leave */ { /* If Battle is not Paused: */ dw_TFraction += 1092; /* Increment TimerFraction by 1092 */ if ( dw_TFraction >> 16 ) /* Is TimerFraction > 65535? (TFraction/65536) */ { ++dw_TSeconds; /* If yes, increment TimerSeconds by 1 */ dw_TFraction & 0xFFFF; /* Reset TimerFraction to 0 */ } dw_T2Fraction += 1092; /* Increment Timer2Fraction by 1092 */ if ( dw_T2Fraction >> 16 ) /* Is Timer2Fraction > 65535? */ { /* Check Timer Direction Flag (up or down) */ if ( b_T2DirF & 2 ) /* If yes, check if T2DirF = 2? */ { ++dw_T2Seconds; /* If yes, increment Timer2Seconds by 1 (CountUp) */ } else { if ( dw_T2Seconds ) /* If no, and not 0, decrement Timer2Seconds by 1 (CountDwn) */ --dw_T2Seconds; } dw_T2Fraction & 0xFFFF; /* Reset T2Fraction to 0 */ } } } LeaveCriticalSection(&CriticalSection); } }
This script predicts when the RNG is in the right spot not when to attack. This should be done either 8 or 4 frames earlier.while true do crit1=math.floor((memory.readbyte(0xf83f5)+memory.readbyte(0xf83e9)-memory.readbyte(0xF8589))/4); crit2=math.floor((memory.readbyte(0xf845d)+memory.readbyte(0xf8451)-memory.readbyte(0xF8589))/4); crit3=math.floor((memory.readbyte(0xf84c5)+memory.readbyte(0xf84b9)-memory.readbyte(0xF8589))/4); rnd1 = memory.readbyte(0x83084+memory.readbyte(0x62e10+(memory.readbyte(0x62e18)+1)%8)); rnd2 = memory.readbyte(0x83084+memory.readbyte(0x62e10+(memory.readbyte(0x62e18)+2)%8)); rnd2=rnd2*256; rnd0=rnd1+rnd2; crit_rng=math.floor((rnd0*99)/65535)+1; if crit1>=crit_rng then gui.text(0,50,"Critical Hit from Character 1!"); else gui.text(0,50,""); end; if crit2>=crit_rng then gui.text(0,60,"Critical Hit from Character 2!"); else gui.text(0,60,""); end; if crit3>=crit_rng then gui.text(0,70,"Critical Hit from Character 3!"); else gui.text(0,70,""); end; gui.text(0,30,"Ennemy 1 crit% = "..crit1.." "..crit2.." "..crit3); gui.text(0,40,"crit_rng = "..crit_rng); emu.frameadvance(); end;
00083080 63 06 F0 23 F8 E5 A8 01 C1 AE 7F 48
00083090 7B B1 DC 09 22 6D 7D EE 9D 58 D5 55 24 39 7A DF
000830A0 8E 54 6C 1B C0 0B D0 43 D8 9A 47 5D 21 02 17 4B
000830B0 DB 11 AF 70 CD 4D 34 49 72 91 2D 62 97 59 45 F7
000830C0 6E 46 AA 0A A3 C8 31 92 38 FA D4 E6 CB F3 DE 6B
000830D0 BB F1 1C 3C D6 AD B2 A9 DD 57 42 95 0C 79 25 1F
000830E0 BC E7 AC 5B 83 28 76 F2 18 DA 87 A1 61 6F BE 5A
000830F0 5E 51 EF B0 C9 15 74 89 BD D1 A2 75 D7 99 85 4C
00083100 4F D2 BF 4A 20 08 56 A0 50 3A 67 26 41 33 B7 BA
00083110 FB 30 CF 7C 84 2C 32 E9 1D 16 82 78 A4 80 65 5F
00083120 0E 27 B9 19 C3 A7 B6 00 3B FC 88 E1 C6 93 FE 8B
00083130 D9 B8 13 69 2F 64 12 37 FD 77 E2 B5 04 E0 1A 8C
00083140 8F B4 CC F9 60 EB 29 E3 90 A5 68 3D 81 73 3F AB
00083150 7E B3 0F CE C4 35 94 96 86 71 D3 2A E4 9F 9C EC
00083160 4E 14 F5 EA 40 A6 F6 03 98 C5 07 F4 2B C2 3E E8
00083170 9B 36 53 2E 8D 0D 52 10 66 1E ED 8A 44 9E 05 FF
00083180 5C C7 6A CA 00
We want to find the most efficient path through here; using the 3 options given above.
If you touch a blue line you get a battle. The red dots show the character's steps. In this case, the default route shown here is simply running through the segment and accepting every battle.
Stuttering has the effect of making the danger value increase by 1/4 compared to that of running. Thus, it makes the red line less steep, it flattens the line out more.
As you can see, using the menu glitch too many times will put you further into the blue-line jungle.
I've reverse engineered the important random encounter routines from the disassembly:
The script I wrote generates the graph above showing the random encounter pattern of any segment. Simply modify the global values at the top of the script for where you are in the game (leave at default to generate the above graph).
My programming skills are still new (aka poor); only 4 days learning Python :P So, I have no clue how I can optimize this whole thing (or even 1 segment at a time).
You can see the battle routine in the script.
Here's the Python script:
Please install Python (2.7.x) if you would like to run the script: https://code.google.com/p/winpython/downloads/list Any help or advice on a possible algorithm would be appreciated :DLanguage: Python## Random Encalculator v0.2 by antd ## import numpy as np import pylab as pl # random number table: rnlist = [0xB1, 0xCA, 0xEE, 0x6C, 0x5A, 0x71, 0x2E, 0x55, 0xD6, 0x00, 0xCC, 0x99, 0x90, 0x6B, 0x7D, 0xEB, 0x4F, 0xA0, 0x07, 0xAC, 0xDF, 0x8A, 0x56, 0x9E, 0xF1, 0x9A, 0x63, 0x75, 0x11, 0x91, 0xA3, 0xB8, 0x94, 0x73, 0xF7, 0x54, 0xD9, 0x6E, 0x72, 0xC0, 0xF4, 0x80, 0xDE, 0xB9, 0xBB, 0x8D, 0x66, 0x26, 0xD0, 0x36, 0xE1, 0xE9, 0x70, 0xDC, 0xCD, 0x2F, 0x4A, 0x67, 0x5D, 0xD2, 0x60, 0xB5, 0x9D, 0x7F, 0x45, 0x37, 0x50, 0x44, 0x78, 0x04, 0x19, 0x2C, 0xEF, 0xFD, 0x64, 0x81, 0x03, 0xDA, 0x95, 0x4C, 0x7A, 0x0B, 0xAD, 0x1F, 0xBA, 0xDD, 0x3E, 0xF9, 0xD7, 0x1A, 0x29, 0xF8, 0x18, 0xB3, 0x20, 0xF6, 0xD1, 0x5E, 0x34, 0x92, 0x7B, 0x24, 0x43, 0x88, 0x97, 0xD4, 0x0F, 0x35, 0xAA, 0x83, 0x68, 0x27, 0xA8, 0xD5, 0xBE, 0xFA, 0x14, 0x31, 0xAF, 0x10, 0x0D, 0xD8, 0x6A, 0xCE, 0x23, 0x61, 0xF3, 0x3D, 0xA4, 0x08, 0x33, 0xE3, 0xA9, 0x38, 0xE6, 0x93, 0x1D, 0x1C, 0xF0, 0x0E, 0x87, 0x59, 0x65, 0x82, 0xBC, 0xFF, 0xFE, 0x7E, 0x8F, 0xC1, 0x1E, 0xF5, 0xCB, 0x49, 0x02, 0x32, 0x09, 0xC4, 0x8E, 0xC6, 0x2B, 0x40, 0xA7, 0x17, 0x76, 0x3B, 0x16, 0x2A, 0xC8, 0xFB, 0xB2, 0x58, 0xA5, 0x15, 0xAE, 0x25, 0xCF, 0x46, 0xC7, 0x48, 0xB4, 0x0A, 0x3F, 0xC9, 0x06, 0x85, 0x51, 0x89, 0x62, 0x4D, 0x12, 0x8C, 0xEA, 0xA2, 0x98, 0x4B, 0x79, 0x6F, 0x5C, 0x47, 0x30, 0x1B, 0xE7, 0xC5, 0x22, 0x9C, 0xE8, 0x96, 0x3A, 0xE4, 0x7C, 0xE0, 0x69, 0xA1, 0xB7, 0x05, 0x39, 0x74, 0x01, 0x9F, 0xBD, 0xC3, 0x84, 0xFC, 0x77, 0x86, 0x13, 0x4E, 0xBF, 0xF2, 0x53, 0x5B, 0xED, 0x21, 0x8B, 0x6D, 0xC2, 0x41, 0xB6, 0xDB, 0x3C, 0xD3, 0x28, 0xEC, 0x2D, 0xE2, 0x9B, 0xA6, 0x42, 0x52, 0x57, 0x5F, 0xE5, 0xAB, 0xB0, 0x0C] ### change some of these: stepid = 24 # set current stepid in field bloop = 13 # set current battle loop in field danger = 0 # set current danger value in field distance = 128 # set field distance in steps run = 113 # set danger increment for running walk = run/4 # danger increment for walking runwalk = run # set whether to 'run' or 'walk' through the field dlimit = 0 total_steps = 0 ## graph stuff: x1 = [] y1 = [] x2 = [] y2 = [] x3 = [] y3 = [] def ShowMyGraph(): plot1, = pl.plot(x1,y1,'r.') plot2, = pl.plot(x2,y2,'b_') plot3, = pl.plot(x3,y3,'-') pl.title('Random Encounter Pattern') pl.xlabel('Step') pl.ylabel('Danger Value') pl.xlim(0.0,150.0) # change x-axis range if needed pl.ylim(0.0,10000) # change y-axis range if needed pl.legend([plot1,plot2], ('Route', 'Battles'), 'best', numpoints=1) #pl.xticks(arange(201, step=50)) # change amount of x-axis numbers pl.show() def PlotSteps(): x1.append(total_steps) y1.append(danger) x2.append(total_steps) y2.append(dlimit) x3.append(total_steps) y3.append(dlimit) ### random encounter stuff: # increment StepID and grab rnd number: def GoStepID(): global stepid, bloop, rnd stepid = (stepid + 1) & 0xFF # increment stepid + reset if > 255 if stepid == 0: # increment battle loop by 13 if 0 bloop = (bloop + 13) & 0xFF rnd = (rnlist[stepid] - bloop) & 0xFF # grab a rnd byte from rnlist # call this function to take *1* step: def BattleCheck(): global dinc, danger, rnd, dlimit, walk, total_steps if runwalk == walk: # let's see if we are running or walking dinc = walk # set the danger increment accordingly else: dinc = run danger = (danger + dinc) & 0xFFFF # increment danger value + reset if > 65535 GoStepID() # this is for preemptive rnd GoStepID() # this is for battle; +2 stepID = 1 step dlimit = ((rnd +1) *256) & 0xFFFF # calc danger limit for battle total_steps += 1 # calculate total steps (for graph only) PlotSteps() # just plots the graph if danger <= dlimit: # if danger is over limit it's battle time print "Next step is SAFE!\n" print "rnd: %d danger: %d, dlimit %d, stepid : %d total: %d\n" % (rnd, danger, dlimit, stepid, total_steps) else: print "Random Encounter on next stepid: %d!\n" % (stepid) print "rnd: %d danger: %d, dlimit %d, stepid : %d total: %d\n" % (rnd, danger, dlimit, stepid, total_steps) danger = 0 # danger is reset in battle while distance > 0: # travel through the whole field BattleCheck() distance = distance - 1 ShowMyGraph()