:pog:

Ah I’m glad about the time, wasn’t sure if anyone else would care aha. Thank you!

@@BLANKdev haha I think any dev would find it enjoyable!

Well I can hope so xD

Hey thank you! I am really happy with how well we fit both the themes, we got super lucky that they worked well together!

I can’t believe how great they turned out for only being little sketches! Hopefully I can keep growing the collection :D

I’m never going to hear the end of this one am I

The new blank characters help that a lot I think, I love them!! Thank you so much for the support :D

@@BLANKdev No problemo!! Keep up the impeccable work!!

Thanks marlin you are always so kind! I think most jams go through a ‘this is awful and the worst thing I have ever made’ phase right.. right? They all do for me anyway aha. Got to agree there though, this game should be racking in all the awards any day now ;)

Outro was good

Don’t know what you mean, that outro was the ramblings of a pure genius… obviously

I can thank Reece for making his theme super easy to do with almost anything else!

It took a lot of tweaking but I am happy with it! Really glad you are too :D

Thank you I really appreciate it :D

Here is where it went: kzfaq.info/get/bejne/n8-bZZio1q_ZdqM.html I should probably fix that…

Why does everyone keep saying that 👀

@@BLANKdev lmaooo

-ok but seriously why-

It’s the 👀 made me think I accidentally put in a random song aha -well I did rickroll you sort of but it’s your own fault if you scan that qr code- Really glad you liked it, I spent far too long looking for it this time xD

OH N O O O I didn’t realise that

No waay thats hilarious aha! I hope it went well!

@@BLANKdev it did! Granted i had a week not 43 hours

And you made an extra game more than me, so the time doesnt matter!

Or instead of the explicit cast, you could use the Mathf.FloorToInt() function again, or vice versa, you could simply use the int cast in both places...

BTW -- While in this case, both Mathf.FloorToInt() and explicitly casting to an int with (int) will return the same results, note that this is not the case with negative numbers as the explicit cast actually just truncates the number at the decimal point. The explicit cast is much faster, though, so in this case better to use. A trick if you are wanting a true floor and there could be negative numbers that is only a small performance hit and still faster than the floor function is to use an explicit cast, but then subtract the boolean check for negative: (int) (someNonIntValue - (someNonIntValue < 0)) The thing I'm not sure about is if doing the cast first and then subtracting the boolean check is faster or if subtracting the boolean check first and then doing the cast is faster...been a while since I've used this one and I also don't understand why under the hood this trick is so much faster. You would think a modern compiler would unwrap both to the same code. Maybe some do?

(int) (someNonIntValue - (someNonIntValue < 0)) This is absolutely fascinating to me I have never seen subtracting a boolean from value before, that is sort of genius I need to look into why that works. If you know and could spare the time I'd love an explanation! As for the compiler, I mean they are pretty damn good now I would imagine it could figure that sort of thing out since it's just different ways of doing the same maths in theory but I would still prefer to write the most efficient mathematic way anyway just for my own sake, so that's a really cool idea you had and I can't wait to try it! Thank you so much for such an in-depth comment, I absolutely love reading through stuff like this, hope you have a wonderful day wherever you are!

@@BLANKdev A boolean is stored as a number just like any other data type, a 1 for true and 0 for false. Internally the computer has no concept of data types. It only understands 1s and 0s. In fact, at the most basic level, these are literally on and off states for the circuitry. A 1 would switch on that part of the circuit and a zero switches it off. A clever combination of logic gates is what allows us to use this to do actual computation. At a higher level, there are some minor differences as for floating point operations, there is often specialized circuitry called the alu or arithmetic logic unit that can perform certain operations faster than running them through the traditional CPU. Even there though, at the hardware level it is electronic gates being flipped on and off very fast. Just the arrangement of those gates are specialized. You do have other circuitry such as timers (clocks) that cycle on and off at a specific frequency. In fact it is critical to have these as the gates don't actually flip on and off instantly and no matter how small we make them (they are super tiny nanoscale) there are delays that add up within the circuits. These timers keep things in sync. Some components wait on others and everything ends up slowing down for the slowest part of an operation. That is why optimization is still critical as well. Even a slightly slower operation can add up to a huge time drain if done enough times. At the hardware level, optimization is done through multistage pipelines, multiple core cpus, predictive computation, caches, and much more. In the software level this can be done with caches, predictive computation and other hardware as software tricks, but we can also take advantage of our knowledge about what we are computing to create shortcuts like the alu does for math operations. It just requires knowing how the data is stored and processed. In some higher level languages, the language wants to protect you from accidental mistakes. That is why in this case, because you are not doing the intended use case for the data type and are discarding part of the information, you have to use an explicit cast to say, "Yes. I want to do this." Before more modern languages and language versions, there would be no warning. The computer would just crash at best or give you invalid data at worst. In fact, relatively speaking, the OS or operating system is new in caring about and catering to your programs to provide a parallel programming experience. In the older computer, you would load a single program, run it. Get the results. Rinse and repeat. You could "pause" the programming part to allow another program to be loaded to work with the same data, but it was not nearly as easy as clicking on one program and then the next. You literally had to "load" different tape wheels or "load" different punch cards onto/into the machine. Before having that you just had lights for output and switches manually flip on and off for input. There is a ton of stuff I've glossed over. An entire SWE degree of stuff, but this should point you to some further reading. I'd suggest starting with a basic computer architecture textbook, logic textbook, os textbook, and then read language manuals. Most languages go into extreme detail about how they work under the hood in their manuals. That said, most of the textbook info can be gathered for free online these days as well and another trick for learning is to just read other people's code, especially built in code. Tutorials can also teach a lot! Finally back to the main subject, most languages will let you manipulate data any way you want. Type safe languages will complain about this, but most recognize the need and provide a way past the nagging, such as explicit casts. For example, you can even add numbers to text. The letter "A" is (usually) stored as the number 65. So adding an integer 1 to it will change it from "A" to "B", integer number 66. Again, in type safe languages you will need an explicit cast, first to the int and then back to the text letter (char) as in: CapB = (char) ((int) "A" + 1). I'm on my phone atm, so I can't validate this exactly, but you get the idea. In fact, in older computers, this was often so much faster and space saving that lowercase letters were written by taking the capital letter and adding the offset to reach 96 for the lowercase "a". To learn more on this, check out the ASCII table (the standard) and Unicode. Unicode uses more than one byte to allow for more characters so you have to be more careful in using tricks with it by knowing if the computer, the file, the OS, or whatever is giving you the data starts with the high byte or low byte. This is known as endianness (which end). Also, there are some caveats trying tricks with floating point. There is a standard there, too. IEEE something. I forget the number right now. Graphics intensive processes and even GPUs use tricks like these to make data manipulation faster. There is a ton of information. Sorry if this answer is overload.

Btw, if you are really curious about taking these tricks to the extreme, check out code golf. It is a game where a problem is solved in various languages trying to use the fewest number of characters possible. Codingame has some puzzles in this style on their website. Their site has ai competitions as well that can allow you to play with tricks to see what is faster or not, but while learning you are free to try just about any code you want. The competitions start with simple rules to ease you in and as you progress, more complex rules are added. The puzzles and competitions are a lot of fun. Doesn't hardly feel like learning. Also, most puzzles will give you a hint where to look for information to solve them in case you aren't familiar with a particular algorithm or topic.

Now that’s a blast from the past, no idea they had a game though!

A poor joke on my behalf, definitely benbonk!

It has been a crazy ride!

OMG I COULD

@@BLANKdev XD

I think so yeah! I am amazed I couldn’t find anyone else to have done it other than him, its a really fun challenge that I am super happy Bbomb suggested!

No….

@@BLANKdev can i trust u...?

@@BLANKdev Ok... so.. my curiosity got me and... yeah, there was no rickrolll... no rickroll at all.... ;-;

@@BumpDev You aren’t the only one to *not* be rickrolled so don’t worry

@@BLANKdev Okay thank you, Mr. BLANKdev, the guy who definitely did not rickroll me...