Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
The physic of this game are confusing and complex. Could you share your notes please? It might speed up getting a 100% run finished.
Also the 100,000 or so rerecords, spoffed or actual? If actual, much respect.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
The Japanese characters occupy the same place in memory space, only with different values. So, simply different pokemon. I'll try to compile or find a list.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
There also a Magnimite, and a Charizard.
You can also get a Rapidash, and a Starmie (I think it's secondary is fighting... maybe.)
Complete list:
gamefaqs.com wrote:
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
There's enough time, but if you're too close you can't swing your sword fast enough, and you can't aim it at him as well. (Z-targeting is disabled in this battle)
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
I lost a time unit on both 1-5 and 1-7 to bad timer. But I gained frames in each and I saved 2 timeunits in 1-6, most of the gain in 1-6 is from a ladder glitch, and the rest from a slightly different tile layout.
I gained I can't recall how many in 1-5 (about 25). 52 in 1-6. Lost some in the transistion, gained 11 in 1-7. Gained from frames in the transistion. And gained 2 frames in 1-8. With some tweaking I might be able to increase that gain to 3 or 4, but it would require doing 2/3 of the level again, and I'm a tired, lazy bastard and going to bed.
http://www.nerdparadise.com/crap/Omni/DonkeyKong-Omni.vbm
And I haven't touched the old one.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
Worked fine for me.
But are you sure that walking diagonal is the same speed as walking up and down. Because you have some wiggling back and forth that may or may not lose time.
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
36000^4096 = 4.12 x 10^18662 (In my haste I made an error)
4096^36000 = A much, much larger number though. (So the error was in xebra's favor)
xebra wrote:
OmnipotentEntity wrote:
Assuming a quantum computer running at 1 GHz ... I winnar is yuo!
I'm not really sure where any of that is coming from. Your comparisons of the methods of operation of classical and quantum computers are very ignorant, and are not remotely applicable or even meaningful. The reason I formulated my first response the way I did was because I didn't want to provoke the kind of response I got from you, and also because I was making a number of assumptions that I didn't wish to explain, hence my argument of "you are probably wrong, go read up on it if you really want to know." If you read up on it, you did a poor job.
Quantum computers do have clock frequencies (just like regular computers they have to perform operations on data, and they do this a certain number of times per second). They just aren't nearly as important compaired to register size. I chose 1 GHz because you probably wouldn't see a Q Computer running at 1 GHz, and it makes the math easy.
Anyways, there exists a quantum algorithm for performing a fairly general type of search more efficiently than the best classical aglorithm. The quantum algorithm is O(N^1/2) while the storage space required is O(Log[N]). That's decent though it's "only" a quadratic improvement over the classical algorithm. As we have been discussing it in this thread, "the perfect movie problem" has not been formulated (as I understand it) in a way that can exploit a more efficient search algorithm. I am assuming there is some way we can formulate "the perfect movie problem" as the type of search that can be performed quickly by the quantum algorithm. Since we are discussing a problem that is easily solvable on classical equipment and seems like it could be formulated as a search, and since the limits of quantum computation are not well understood, I think it's a reasonable if optimistic assumption.
Here is where you are mistaken. You're thinking of searches in the variety of P and NP problems. Unfortunately, the problem class of this is #P, because there isn't one right answer and you have to search through all possible combinations in order to find it (because there really is no way of ascertaining whether or not a one frame improvent can be made over the ten minutes from the emulation and the movie file). Which is why I didn't bother with the Big-O function, because the Big-O describes the asymptote of an algorithm, while here we have an algorithm that we can calculate will always run for a specific time, so Big-O is superfluous.
This is, of course, without pruning, which is probably a Good Idea™, as it greatly speeds up a similar, but vastly less complicated, problem, solving a Rubik's Cube optimally from a given posistion.
xebra wrote:
P.S. Wtf is a rectal figure? Rectal means "related to the rectum" which is in your ass, and if you want to be taken seriously, that's not the best place to pull arguments from.
Yes, that is the definition. Meaning in this case, that I have no way of knowing what we'll have to deal with in 10, 50, or 100 years, whenever Q Computers get up to snuff. But, I'm making some intelligent guesses that I have no evidence for, and no evidence could possibly be produced for any figure. Therefore, it's just as if I pulled it out of my ass. Which I did.
xebra wrote:
The comments about quantum computers remain pertinent, though. Quantum computers allow you to do things like evaluate functions at multiple points simultaneously. {snip}
If you didn't read my post correctly, that's what I was doing.
Deviance wrote:
the topic says "magically." So to stay on topic, they'll have to change their discussion of computers to genie lamps. :P
Only if they are quantum genie lamps that can produce a superposistion of all wishes I'd make, and then collapse to a single wish when I tried to act it in a non-deterministic way based on the probability of the wishes I'd make.
Because that would rock! ^^;
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
Experienced Forum User, Published Author, Player
(36)
Joined: 9/11/2004
Posts: 2624
If you define a glitch as an "unintended side effect of the game's programing" then sequence breaking is a glitch. I think it needs a better definition than that...
Build a man a fire, warm him for a day,
Set a man on fire, warm him for the rest of his life.
