At 59.7275005696058 FPS it will give proper results: 178 frames -> (2.9802... seconds) -> 00:00:02.98 179 frames -> (2.9969... seconds) -> 00:00:03.00 180 frames -> (3.0136... seconds) -> 00:00:03.01Language: lualocal function totimeseconds(frames,fps) ---- option 1, cutting off: ---- 2.994 -> 2.99 ---- 2.996 -> 2.99 --local fullsecs = frames/fps ---- option 2, rounding at half steps: ---- 2.994 -> 2.99 ---- 2.996 -> 3.00 local fullsecs = math.floor(((frames/fps)*100)+0.5)/100 local hours = math.floor(fullsecs/3600) local mins = math.floor(fullsecs/60)%60 local secs = math.floor(fullsecs%60) local ms = math.floor(fullsecs*100)%100 return string.format("%02d:%02d:%02d.%02d",hours,mins,secs,ms) end
<Nach> Masterjun now grows a cape right out of his shoulders <Nach> what will Masterjun do? <Masterjun> spin to win <Nach> Masterjun spins super quickly pulling all the Spaghetti into himself and becomes a giant Spaghetti monster in his own right!
Anyone know the current bsnes core version that is used in the current Bizhawk release?
- 
- 
The full list of framecounts where piece are placed one frame too late:
3472, 4215, 6028, 6607, 6643 (DAS), 6800, 7121, 7304, 7570, 8026, 8833, 9426, 9751, 9971
Saving the 14 frames from the original 02:42.63 in-game time, you get 02:42.40.
However, I want a new submission to get the Gold AC medal, so this is a post just for reference.
AC Medal: One all clear is performed at the start for the Bronze AC medal. As previously mentioned, there is too much RNG involved to get a higher medal than that
How do you prove that sqrt(2) isn't an integer?
Of course, this assumes the monotonic property (strictly increasing) of square roots. In other words, x<y ⇒ sqrt(x)<sqrt(y), which can be proven easily. (Here's my attempt)
In Lua, is it possible to split a hexadecimal number in two?
However, these bitwise operation were only introduced to Lua in version 5.3. It's useful to know that this can also be done by using division and splitting up the integer part (integer division) and the remainder part (modulo operation): Think how dividing 5678 by 100 will give you 56.78 - the integer part 56 and remainder part 78. This is the same in base 16: 0x1234 dividing by 0x100 will give you an integer part 0x12 and a remainder part 0x34. Getting the integer part is done by using math.floor and the remainder part uses %:Language: luanum = 0x1234 print(num & 0xF) -- 0x4 print(num & 0xFF) -- 0x34 print(num & 0xFFF) -- 0x234 print(num >> 4) -- 0x123 print(num >> 8) -- 0x12 print(num >> 12) -- 0x1
Language: luanum = 0x1234 print( math.floor(num/0x100) ) -- 0x12 -- math.floor to simulate integer division print( num%0x100 ) -- 0x34 -- modulo operator %
For years I have been wondering, and often commenting about, how TASing exhibitions at the GDQ events have devolved from "speedrunning with superhuman perfect skills" to "let's exploit games and inject our own code into the console"
