Mixing up 転校生 and 留学生 is actually kind of a screw-up on my part that I didn't even think about until you mentioned it. I've been calling the subtitle "Exchange Student Scramble" for probably 10 years (since before I spoke Japanese), so it's basically down to a very old misunderstanding that I didn't think to question. During work on the game, I also named the character after myself with a Western name, which I'm sure reinforced this idea in my head. I'll consider changing this to Transfer Student - thanks for bringing it up.

Good work, Gideon.
Just a couple nitpick things. Is it possible to space that stats a bit so the numbers aren't touching up to the text, like "Intelligence147". Just look nicer.
I also wonder if it would be better to use "soccer" instead of "football", just to make the distinction more internationally understood.

You could replace Intelligence with Intellect, perhaps.

I was initially hesitant in being able to fit Paul Jensen's translation in the given screen space, but as I found out I can have multiple screens of text per string. However, four lines of text is enough for a game like this.

You might wanna fix Rosa's bow. Just sayin'.

A binary wildcard searcher kinda thing; capable of searching through any given file using the given pattern. "!" statements define byte alignments the results have to adhere to (ex. "!8" means the result must be at an offset xxxxx0 or xxxxx8 in the file), "?" statements are wildcards of the specified length (ex. ?3 means three arbitrary bytes) and >, >=, < and <= are what you'd expect, with those placed in front of a constant byte, the result can be greater than, greater or equal, less than or less or equal the given value.

The results are also color-coded, with green bytes meaning a perfect match, orange ones a match found via greater/less/or equal searches and red ones are wildcard matches. In addition, right-clicking a result allows copying of either the offset where it was found, or the values themselves to the clipboard, ex. for use with a hex editor.

Is there any use for this, or am I wasting my evening?

(Oh, and also, with those explanations, can you deduct what I was looking for in those screenshots (the left being my test case, the right being a map from Zelda OoT)?)

messiaen: Started implementing your ideas - so far, it's possible to search for numbers of up to 64-bit (that is anything between 0x0000000000000000 and 0xFFFFFFFFFFFFFFFF), 32-bit floating point searching works (like ex. "1.0f32", which in hex is 0x3F800000), for all of those, greater than/greater or equal/less than/less or equal/not equal can be specified, and you can mix and match hexadecimal, decimal and floating point searching in the pattern. In addition, the results can now be grouped together as 8-bit, 16-bit, 32-bit and 64-bit values or automatically, according to the lengths of the components you've searched for.

What's not done is searching for negative values, so something like "-123d" won't work yet and instead just spit out an error message, but that's how the statement will look like once it's implemented.

And here's a new screenshot of my test case v3.whatever - we're searching for 1.0 as a 32-bit float, 0x40, three unknown bytes, a value bigger than 0x400000, another unknown byte, 8.5 as a 32-bit float, and a value bigger than 0x03.

It's looking amazing, best of luck to you two!