Official Everybody Edits Forums

48

Yes

Hello Dazz! I remember you making some pretty cool art back in the day. It's weird to think I was probably 10-12 years old when I first saw your art worlds, and now I'm 22.

This is a really good game imo. Amazing soundtrack, sweet story, and fun challenging gameplay. Highly recommend unlocking the extra content like B-sides, and chapter 8 and 9. Chapter 9 especially has some very creative challenges/mechanics (though I didn't like the second half as much).

It could be that they are talking about the total number of players, not the amount of players online at once.

I mostly agree, but I think up to FV is fun, even though I haven't beaten FV. For me it stops being fun after that, maybe because it's so beyond my ability. Or maybe the levels that come after are just lower quality than FV. But I really admire the players that are able to beat them, that display of skill is just cool to me. So I guess I appreciate those levels for being able to test those top players and push the boundaries further.

Jumping 100 numbers ahead was fine as an informal way to show N1KF's point, but I think a formal proof should just use increments of 1 like any other induction, otherwise things probably get unnecessarily convoluted.

It would be sufficient to prove that every number greater than 4 is greater than the length of its text equivalent, because this would mean the pattern would be strictly reducing until you get to 4 or below, then as we've already shown it will just go back to 4.

It would be a proof by induction with a bunch of cases to handle based on the way we encode numbers to text.

Each case would affect the gap between the number and the length of the string, either making it bigger or smaller. If the gap gets bigger or stays the same (string gets smaller, stays the same or goes +1), then the assumption holds. If it gets smaller (string gets bigger by more than 1), then we have to prove that the gap doesn't close, i.e. that the number is still greater than the length of the string. That probably either requires us to prove a lower bound for the gap for each case where this happens, or we actually have to extend the assumption include a lower bound on the gap and do induction on that as well. I suspect the latter could work because it seems like the gap generally gets bigger, even if it fluctuates at times, so we assume a lower bound and just make sure the fluctuations are never big enough to make the gap close.

Something I can observe is that most of the increases in string size happen in the numbers 1-19. 2 digit numbers higher than that are the same as incrementing from 1-9. 3 digit numbers are encoded the same as 2 digit numbers but with some extra words in front, so we see the same pattern. It looks like incrementing a number ending in 9 is always non-increasing string-wise. Adding a new digit (99 -> 100, 999 -> 1000, etc.) is also non-increasing string-wise, since a bunch of digits become 0. Hopefully it's clear that there's a finite amount of stuff to prove here, since the encoding is systematic and you can kind of generalise it. Though technically every 3 digits we are adding a new word (thousand, million, billion, trillion, ...), which kind of needs a limit. If my observation is right then you only need to handle increases in string size in numbers 1-19, and show that those fluctuations get "corrected" and will never be big enough to close the gap for numbers over x. Just have to show all this stuff formally and you have your proof.

She posted this update just 6 days ago.

Thanks I honestly had no idea what OP meant until you posted this. However since I'm not a meth addict I don't think this is neat at all.

Agree with this, Odyssey is still one of my favourite maps. Another that comes to mind is Stagecrew's Endeavour.